Katedra Algorytmiki - lista publikacji
Nadjednostka:
1-20 z 20.
2018
20.
A Note on Two-Colorability of Nonuniform Hypergraphs, International Colloquium on Automata Languages and Programming [ICALP] vol. 107 (Leibniz International Proceedings in Informatics) (2018), 46:1-46:13
19.
Kolja Knauer, Piotr Micek, Torsten Ueckerdt
The Queue-Number of Posets of Bounded Width or Height vol. 11282 of Lecture Notes in Computer Science (2018), "Graph Drawing and Network Visualization. GD 2018", Springer
18.
Gwenaël Joret, Piotr Micek, Veit Wiechert
Sparsity and dimension, Combinatorica vol. 38 (2018), 1129-1148
17.
Stefan Felsner, Gwenaël Joret, Piotr Micek, William T. Trotter, Veit Wiechert
Burling Graphs, Chromatic Number, and Orthogonal Tree-Decompositions, Electronic Journal of Combinatorics vol. 25 (1) (2018), P1.35
16.
Bartłomiej Bosek, Przemysław Gordinowicz, Jarosław Grytczuk, Nicolas Nisse, Joanna Sokół, Małgorzata Śleszyńska-Nowak
Centroidal Localization Game, Electronic Journal of Combinatorics vol. 25 (4) (2018), 1-19
15.
Bartłomiej Bosek, Przemysław Gordinowicz, Jarosław Grytczuk, Nicolas Nisse, Joanna Sokół, Małgorzata Śleszyńska-Nowak
Localization game on geometric and planar graphs, Discrete Applied Mathematics vol. 251 (2018), 30-39
14.
Paweł Idziak, Piotr Kawałek, Jacek Krzaczkowski
Expressive Power, Satisfiability and Equivalence of Circuits over Nilpotent Algebras vol. Leibniz International Proceedings in Informatics (LIPIcs) (2018), "43rd International Symposium on Mathematical Foundations of Computer Science (MFCS 2018)", Schloss Dagstuhl – Leibniz-Zentrum für Informatik
13.
Satisfiability in multi-valued circuits, (2018), "Proceedings of the 33rd Annual ACM/IEEE Symposium on Logic in Computer Science (LICS'18)", Association for Computing Machinery (ACM)
12.
Bartłomiej Bosek, Dariusz Leniowski, Piotr Sankowski, Anna Zych-Pawlewicz
A Tight Bound for Shortest Augmenting Paths on Trees vol. 10870 (2018), "LATIN 2018: Theoretical Informatics", Springer
11.
Alexandr Kazda, Marcin Kozik, Ralph McKenzie, Matthew Moore
Absorption and directed Jónsson terms, (2018), "Don Pigozzi on Abstract Algebraic Logic", Springer
10.
Grzegorz Gutowski, Ming Han, Tomasz Krawczyk, Xuding Zhu
Defective 3-Paintability of Planar Graphs, Electronic Journal of Combinatorics vol. 25 (2) (2018), 20
9.
Bartłomiej Bosek, H. A. Kierstead, Tomasz Krawczyk, Grzegorz Matecki, Matthew Smith
An Easy Subexponential Bound for Online Chain Partitioning, Electronic Journal of Combinatorics vol. 25(2) (2018), #P2.28
8.
Deferred On-Line Bipartite Matching, Electronic Journal of Combinatorics vol. 25 (2) (2018), P2.24
7.
Patryk Mikos
A new lower bound for the on-line coloring of intervals with bandwidth, Theoretical Computer Science vol. 708 (2018), 96-100
6.
Bartłomiej Bosek, Dariusz Leniowski, Piotr Sankowski, Anna Zych-Pawlewicz
Shortest Augmenting Paths for Online Matchings on Trees, Theory of Computing Systems vol. 62(2) (2018), 337-348
5.
Bartłomiej Bosek, Michał Dębski, Jarosław Grytczuk, Joanna Sokół, Małgorzata Śleszyńska-Nowak, Wiktor Żelazny
Graph coloring and Graham’s greatest common divisor problem, Discrete Mathematics vol. 341(3) (2018), 781-785
4.
Karol Kosiński, Robert Mercas, Dirk Nowotka
3.
2.
On an Extremal Problem for Poset Dimension, Order vol. 35(3) (2018), 489-493
1.
Steven Chaplick, Grzegorz Guśpiel, Grzegorz Gutowski, Tomasz Krawczyk, Giuseppe Liotta
The Partial Visibility Representation Extension Problem, Algorithmica vol. 80 (8) (2018), 2286-2323