Katedra Algorytmiki - lista publikacji
Nadjednostka:
201-267 z 267.
2012
67.
Libor Barto, Marcin Kozik
Absorbing subalgebra, cyclic terms and the Constraint Satisfaction Problem, Logical Methods in Computer Science vol. 20 (2012), paper no. 7
66.
On the maximum number of five-cycles in a triangle-free graph, Journal of Combinatorial Theory. Series B vol. 102 (2012), 1061-1066
65.
Indicated colorings of graphs, Discrete Mathematics vol. 312 (2012), 3467-3472
64.
Pavel Klavík, Jan Kratochvíl, Tomasz Krawczyk, Bartosz Walczak
Extending partial representations of function graphs and permutation graphs vol. 7501 of Lecture Notes in Computer Science (2012), "Algorithms – ESA 2012, 20th Annual European Symposium on Algorithms, Ljubljana, Slovenia, September 10-12, 2012, Proceedings", Springer
63.
Kolja Knauer, Piotr Micek, Bartosz Walczak
Outerplanar graph drawings with few slopes vol. 7434 of Lecture Notes in Computer Science (2012), "Computing and Combinatorics, 18th Annual International Conference, COCOON 2012, Sydney, Australia, August 20-22, 2012, Proceedings", Springer
62.
Parity in graph sharing games, Discrete Mathematics vol. 312 (2012), 1788-1795
61.
Bartłomiej Bosek, Stefan Felsner, Kolja Knaur, Grzegorz Matecki
News about Semiantichains and Unichain Coverings, Lecture Notes in Computer Science vol. 7353 (2012), 43-51
60.
On-line version of Rabinovitch theorem for proper intervals, Discrete Mathematics vol. 312(23) (2012), 3426-3436
59.
On-Line Chain Partitions of Orders: A Survey, Order vol. 29(1) (2012), 49-73
2011
58.
Jarosław Grytczuk, Jakub Przybyło, Xuding Zhu
Nonrepetitive list colourings of paths, Random Structures and Algorithms vol. 38 (2011), 162-173
57.
Paweł Idziak, Irena Katarzyna Korwin-Słomczyńska, Andrzej Wroński
The commutator in equivalential algebras and Fregean varieties, Algebra Universalis vol. 65 (2011), 331-340
56.
Kolja Knauer, Piotr Micek, Torsten Ueckerdt
How to eat 4/9 of a pizza, Discrete Mathematics vol. 311 (2011), 1635-1645
55.
A graph-grabbing game, Combinatorics Probability and Computing vol. 20 (2011), 623-629
54.
Forbidden structures for efficient First-Fit chain partitioning (extended abstract), Electronic Notes in Discrete Mathematics vol. 38 (2011), 173-179
2010
53.
Term equation satisfiability over finite algebras, International Journal of Algebra and Computation vol. 20(8) (2010), 1001-1020
52.
Libor Barto, Marcin Kozik
Cyclic terms for SD(V) varieties revisited, Algebra Universalis vol. 64 (2010), 137-142
51.
Libor Barto, Marcin Kozik
New conditions for Taylor varieties and CSP, Proceedings of the 25th Ieee/acm Symposium On Logic in Computer Science Lics'10 (2010), 100-109
50.
Paweł Idziak, Petar Marković, Ralph McKenzie, Matthew Valeriote, Ross Willard
Tractability and learnabilty arising from algebras with few subpowers, SIAM Journal on Computing vol. 39 (2010), 3023-3037
49.
Joel Berman, Paweł Idziak, Petar Marković, Ralph McKenzie, Matthew Valeriote, Ross Willard
Varieties with few subalgebras of powers, Transactions of the American Mathematical Society vol. 362 (2010), 1445-1473
48.
The Sub-exponential Upper Bound for On-Line Chain Partitioning, (2010), "51th Annual IEEE Symposium on Foundations of Computer Science, FOCS 2010, October 23-26, 2010, Las Vegas, Nevada, USA", Institute of Electrical and Electronics Engineers (IEEE)
47.
First-Fit Algorithm for the On-Line Chain Partitioning Problem, SIAM Journal on Discrete Mathematics vol. 23(4) (2010), 1992-1999
2009
46.
A 2EXPTIME Complete Varietal Membership Problem, SIAM Journal on Computing vol. 6 (2009), 2443-2467
45.
Libor Barto, Marcin Kozik, Todd Niven
44.
Libor Barto, Marcin Kozik
Congruence distributivity implies bounded width, SIAM Journal on Computing vol. 39 (2009), 1531-1542
43.
Libor Barto, Marcin Kozik, Miklós Maróti, Todd Niven
CSP dichotomy for special triads, Proceedings of the American Mathematical Society vol. 137 (2009), 2921-2934
42.
Libor Barto, Marcin Kozik
Constraint Satisfaction Problems of Bounded Width, Proceedings of the 50th Symposium On Foundations of Computer Science, Focs'09 (2009), 595-603
41.
Libor Barto, Marcin Kozik, Miklós Maróti, Ralph McKenzie, Todd Niven
Congruence modularity implies cyclic terms for finite algebras, Algebra Universalis vol. 61 (2009), 365-380
40.
Jarosław Grytczuk, Sebastian Czerwiński, Wiktor Żelazny
Lucky labelings of graphs, Information Processing Letters vol. 109 (2009), 1078-1081
39.
Jarosław Grytczuk, Stanisław Niwczyk, Tomasz Bartnicki
Weight choosability of graphs, Journal of Graph Theory vol. 60 (2009), 242-256
38.
Paweł Idziak, Ralph McKenzie, Matthew Valeriote
37.
Paweł Idziak, Keith Kearnes, Emil Kiss, Matthew Valeriote
Definable principal congruences and solvability, Annals of Pure and Applied Logic vol. 157 (2009), 30-49
36.
Paweł Idziak, Irena Katarzyna Korwin-Słomczyńska
Fregean Varieties, International Journal of Algebra and Computation vol. 19 (2009), 595–645
35.
Noga Alon, Jarosław Grytczuk, Michał Lasoń, Mateusz Michałek
Splitting necklaces and measurable colorings of the real line, Proceedings of the American Mathematical Society vol. 137 (2009), 1593-1599
2008
34.
Witold Charatonik, Michał Wrona
33.
Witold Charatonik, Michał Wrona
Quantified Positive Temporal Constraints, Lecture Notes in Computer Science vol. 5213 (2008), 94-108
32.
A finite set of functions with an EXPTIME-complete composition problem, Theoretical Computer Science vol. 407 (2008), 330-341
31.
Marcin Kozik, Gábor Kun
The subdirectly irreducible algebras in the variety generated by graph algebras, Algebra Universalis vol. 58 (2008), 229-242
30.
Libor Barto, Marcin Kozik, Todd Niven
Graphs, polymorphisms and the complexity of homomorphism problems, Proceedings of the 40th Acm Symposium On Theory of Computing, Stoc'08 (2008), 789-796
29.
Bostjan Bresar, Jarosław Grytczuk, Iztok Peterin, Sandi Klavzar, Stanisław Niwczyk
Nonrepetitive colorings of trees, Discrete Mathematics vol. 307 (2008), 163-172
28.
Jarosław Grytczuk, Hal Kierstead, Tomasz Bartnicki
The game of arboricity, Discrete Mathematics vol. 308 (2008), 1388-1393
27.
Jarosław Grytczuk, Tomasz Bartnicki
A note on the game chromatic index of graphs, Graphs and Combinatorics vol. 24 (2008), 1-4
26.
Noga Alon, Jarosław Grytczuk
Breaking the rhythm on graphs, Discrete Mathematics vol. 308 (2008), 1375-1380
25.
Bostjan Bresar, Jarosław Grytczuk, Iztok Peterin, Matijaz Kovse, Tomasz Bartnicki, Zofia Miechowicz
Game chromatic number of Cartesian product graphs, Electronic Journal of Combinatorics vol. 15 (2008), 13
24.
Jarosław Grytczuk
Thue type problems for graphs, points, and numbers, Discrete Mathematics vol. 308 (2008), 4419-4429
23.
Jarosław Grytczuk
Invisible runners in finite fields, Information Processing Letters vol. 108 (2008), 64-67
22.
Jarosław Grytczuk, Hal Kierstead, Paweł Prałat
On-line Ramsey numbers for paths and stars, Discrete Mathematics and Theoretical Computer Science vol. 10 (2008), 63-74
21.
On-line coloring of P_5-free graphs, Acta Informatica vol. 45 (2008), 79-91
20.
Antoine Genitrini, Jakub Kozik, Grzegorz Matecki
On the density and the structure of the Peirce-like formulae, Discrete Mathematics and Theoretical Computer Science Proceedings (2008), 461-474
19.
Optimal Orientation On-Line, Lecture Notes in Computer Science vol. 4910 (2008), 271-279
2007
18.
Witold Charatonik, Michał Wrona
2-SAT Problems in Some Multi-Valued Logics Based on Finite Lattices, 37th International Symposium On Multiple-valued Logic, Ismvl 2007 vol. IEEE Computer Society (2007), 21
17.
16.
Patrick Baier, Bartłomiej Bosek, Piotr Micek
On-line Chain Partitioning of Up-growing Interval Orders, Order vol. 24(1) (2007), 1-13
2006
15.
An algorithmic approach to the problem of a semiretract base, Theoretical Computer Science vol. 369 (2006), 314-322
14.
On-line Coloring of I_s-free graphs and co-planar graphs, Discrete Mathematics and Theoretical Computer Science Proceedings vol. AF (2006), 61-68
13.
On-line adaptive chain covering of upgrowing posets, Discrete Mathematics & Theoretical Computer Science Proceedings vol. AF (2006), 37-48
2005
12.
An automaton that recognizes the base of a semiretract, Words 2005, 5-th International Conference On Words (2005), 235-247
11.
Joel Berman, Paweł Idziak
Generative Complexity in Algebra, Memoirs of the American Mathematical Society vol. 175 (2005), 1-168
10.
On-line coloring and cliques covering for K_st-free graphs, Acta Informatica vol. 42 (2005), 1-20
9.
Variants of Online Chain Partition Problem of Posets, Electronic Notes in Theoretical Computer Science vol. 140 (2005), 3-13
2003
8.
Jerzy Jaromczyk, Andrzej Pezarski, Maciej Ślusarek
An optimal competitive algorithm for the minimal clique covering in circular arc graphs, European Workshop on Computational Geometry [EuroCG], (2003), 48-51
7.
Semiretracts – a counterexample and some results , Theoretical Computer Science vol. 307 (2003), 117-127
1998
6.
Tomasz Kaczynski, Marian Mrozek, Maciej Ślusarek
Homology Computation by Reduction of Chain Complexes, Computers and Mathematics with Applications vol. 35 (1998), 59-70
1997
5.
1995
4.
1989
3.
A coloring algorithm for interval graphs, International Symposium on Mathematical Foundations of Computer Science [MFCS], (1989), 471-480
1988
2.
Marek Chrobak, Maciej Ślusarek
1985
1.
A note on the dynamic storage allocation problem, Information Processing Letters vol. 20 (1985), 223-227
Przejdź do strony: