Katedra Algorytmiki - lista publikacji

Term equation satisfiability over finite algebras, International Journal of Algebra and Computation vol. 20(8) (2010), 1001-1020

Cyclic terms for SD(V) varieties revisited, Algebra Universalis vol. 64 (2010), 137-142

New conditions for Taylor varieties and CSP, Proceedings of the 25th Ieee/acm Symposium On Logic in Computer Science Lics'10 (2010), 100-109

Tractability and learnabilty arising from algebras with few subpowers, SIAM Journal on Computing vol. 39 (2010), 3023-3037

Varieties with few subalgebras of powers, Transactions of the American Mathematical Society vol. 362 (2010), 1445-1473

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)

First-Fit Algorithm for the On-Line Chain Partitioning Problem, SIAM Journal on Discrete Mathematics vol. 23(4) (2010), 1992-1999

A 2EXPTIME Complete Varietal Membership Problem, SIAM Journal on Computing vol. 6 (2009), 2443-2467

The CSP dichotomy holds for digraphs with no sources and no sinks (a positive answer to a conjecture of Bang-Jensen and Hell), SIAM Journal on Computing vol. 38 (2009), 1782-1802

Congruence distributivity implies bounded width, SIAM Journal on Computing vol. 39 (2009), 1531-1542

CSP dichotomy for special triads, Proceedings of the American Mathematical Society vol. 137 (2009), 2921-2934

Constraint Satisfaction Problems of Bounded Width, Proceedings of the 50th Symposium On Foundations of Computer Science, Focs'09 (2009), 595-603

Congruence modularity implies cyclic terms for finite algebras, Algebra Universalis vol. 61 (2009), 365-380

Lucky labelings of graphs, Information Processing Letters vol. 109 (2009), 1078-1081

Weight choosability of graphs, Journal of Graph Theory vol. 60 (2009), 242-256

The structure of locally finite varieties with polynomially many models, Journal of the American Mathematical Society vol. 22 (2009), 119-165

Definable principal congruences and solvability, Annals of Pure and Applied Logic vol. 157 (2009), 30-49

Fregean Varieties, International Journal of Algebra and Computation vol. 19 (2009), 595–645

Splitting necklaces and measurable colorings of the real line, Proceedings of the American Mathematical Society vol. 137 (2009), 1593-1599

Tractable Quantified Constraint Satisfaction Problems over Positive Temporal Templates, Lecture Notes in Artificial Intelligence vol. 5330 (2008), 543-557

Quantified Positive Temporal Constraints, Lecture Notes in Computer Science vol. 5213 (2008), 94-108

A finite set of functions with an EXPTIME-complete composition problem, Theoretical Computer Science vol. 407 (2008), 330-341

The subdirectly irreducible algebras in the variety generated by graph algebras, Algebra Universalis vol. 58 (2008), 229-242

Graphs, polymorphisms and the complexity of homomorphism problems, Proceedings of the 40th Acm Symposium On Theory of Computing, Stoc'08 (2008), 789-796

Nonrepetitive colorings of trees, Discrete Mathematics vol. 307 (2008), 163-172

The game of arboricity, Discrete Mathematics vol. 308 (2008), 1388-1393

A note on the game chromatic index of graphs, Graphs and Combinatorics vol. 24 (2008), 1-4

Breaking the rhythm on graphs, Discrete Mathematics vol. 308 (2008), 1375-1380

Game chromatic number of Cartesian product graphs, Electronic Journal of Combinatorics vol. 15 (2008), 13

Thue type problems for graphs, points, and numbers, Discrete Mathematics vol. 308 (2008), 4419-4429

Invisible runners in finite fields, Information Processing Letters vol. 108 (2008), 64-67

On-line Ramsey numbers for paths and stars, Discrete Mathematics and Theoretical Computer Science vol. 10 (2008), 63-74

On-line coloring of P_5-free graphs, Acta Informatica vol. 45 (2008), 79-91

On the density and the structure of the Peirce-like formulae, Discrete Mathematics and Theoretical Computer Science Proceedings (2008), 461-474

Optimal Orientation On-Line, Lecture Notes in Computer Science vol. 4910 (2008), 271-279

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

Computationally and algebraically complex finite algebra membership problems, International Journal of Algebra and Computation vol. 17 (2007), 1635-1666]

On-line Chain Partitioning of Up-growing Interval Orders, Order vol. 24(1) (2007), 1-13

An algorithmic approach to the problem of a semiretract base, Theoretical Computer Science vol. 369 (2006), 314-322

On-line Coloring of I_s-free graphs and co-planar graphs, Discrete Mathematics and Theoretical Computer Science Proceedings vol. AF (2006), 61-68

On-line adaptive chain covering of upgrowing posets, Discrete Mathematics & Theoretical Computer Science Proceedings vol. AF (2006), 37-48

An automaton that recognizes the base of a semiretract, Words 2005, 5-th International Conference On Words (2005), 235-247

Generative Complexity in Algebra, Memoirs of the American Mathematical Society vol. 175 (2005), 1-168

On-line coloring and cliques covering for K_st-free graphs, Acta Informatica vol. 42 (2005), 1-20

Variants of Online Chain Partition Problem of Posets, Electronic Notes in Theoretical Computer Science vol. 140 (2005), 3-13

An optimal competitive algorithm for the minimal clique covering in circular arc graphs, European Workshop on Computational Geometry [EuroCG], (2003), 48-51

Semiretracts – a counterexample and some results , Theoretical Computer Science vol. 307 (2003), 117-127

Homology Computation by Reduction of Chain Complexes, Computers and Mathematics with Applications vol. 35 (1998), 59-70

A Characterization of Finitely Decidable Congruence Modular Varieties, Transactions of the American Mathematical Society vol. 349 (1997), 903-934

Optimal on-line coloring of circular arc graphs, RAIRO - Theoretical Informatics and Applications vol. 20 (1995), 423-429

A coloring algorithm for interval graphs, International Symposium on Mathematical Foundations of Computer Science [MFCS], (1989), 471-480

On some packing problem related to dynamic storage allocation, RAIRO - Theoretical Informatics and Applications vol. 22 (1988), 487-499

A note on the dynamic storage allocation problem, Information Processing Letters vol. 20 (1985), 223-227