Katedra Algorytmiki - lista publikacji
Nadjednostka:
1-200 z 287.
2025
287.
Tara Abrishami, Marcin Briański, Jadwiga Czyżewska, Rose McCarty, Martin Milanič, Paweł Rzążewski, Bartosz Walczak
286.
Classical simulation of quantum CSP strategies, IEEE Symposium on Logic in Computer Science [LICS], (2025),
285.
Jędrzej Hodor, William T. Trotter
Forcing the wheel, Order (2025),
284.
Vida Dujmović, Gwenaël Joret, Piotr Micek, Pat Morin, David R. Wood
Planar graphs in blowups of fans, ACM/SIAM Symposium on Discrete Algorithms [SODA], (2025), 3382-3391
283.
Jędrzej Hodor, Hoang La, Piotr Micek, Clément Rambaud
Weak coloring numbers of minor-closed graph classes, ACM/SIAM Symposium on Discrete Algorithms [SODA], (2025), 3325-3334
282.
Kevin Beanland, Jędrzej Hodor
The depth of Tsirelson’s norm, Studia Mathematica vol. 280 (2025), 27-54
281.
2024
280.
Libor Barto, Zarathustra Brady , Andrei Bulatov, Marcin Kozik, Dmitriy Zhuk
Unifying the three algebraic approaches to the CSP via minimal Taylor algebras, Theoretics vol. 3 (2024),
279.
An Order out of Nowhere: A New Algorithm for Infinite-Domain {CSP}s, vol. 297 (2024), 148:1--148:18
278.
Ciardo Lorenzo, Marcin Kozik, Andrei Krokhin, Vesa Nakajima Tamio , Zivny Stanislav
1-in-3 vs. Not-All-Equal: Dichotomy of a broken promise, IEEE Symposium on Logic in Computer Science [LICS], (2024), Article No.: 24, Pages 1 - 12
277.
Vida Dujmović, Gwenaël Joret, Piotr Micek, Pat Morin, David R. Wood
276.
Antoine Mottet, Tomáš Nagy, Michael Pinsker, Michał Wrona
275.
Jakub Rydval, Zaneta Semanisinova, Michał Wrona
Identifying Tractable Quantified Temporal Constraints Within Ord-Horn, International Colloquium on Automata Languages and Programming [ICALP] vol. 297 (2024), 20
274.
Paweł Kropiński, Bartłomiej Bosek, Mikołaj Pudo
273.
First-Fit Coloring of Forests in Random Arrival Model, International Symposium on Mathematical Foundations of Computer Science [MFCS] vol. 306 (2024), 33:1-33:10
272.
Marcin Anholcer, Bartłomiej Bosek, Jarosław Grytczuk
Majority choosability of countable graphs, European Journal of Combinatorics vol. 117 (2024), 103829
271.
Dynamic Prices in Ride-Sharing Scenarios, International Conference on Vehicle Technology and Intelligent Transport Systems [VEHITS], (2024), 437-443
270.
Lech Duraj, Krzysztof Potępa, Filip Konieczny
Better Diameter Algorithms for Bounded VC-Dimension Graphs and Geometric Intersection Graphs, European Symposium on Algorithms [ESA] vol. 308 (2024), 51:1-51:18
269.
Injective hardness condition for PCSPs, IEEE Symposium on Logic in Computer Science [LICS], (2024), article number 8
268.
Adam Polak, Maksym Zub
Learning-augmented maximum flow, Information Processing Letters vol. 186 (2024), 106487
267.
Vida Dujmović, Robert Hickingbotham, Gwenaël Joret, Piotr Micek, Pat Morin, David R. Wood
The excluded tree minor theorem revisited, Combinatorics Probability and Computing vol. 33 (2024), 85-90
266.
Meike Hatzel, Gwenaël Joret, Piotr Micek, Marcin Pilipczuk, Torsten Ueckerdt, Bartosz Walczak
Tight bound on treedepth in terms of pathwidth and longest path, Combinatorica vol. 44 (2024), 417-427
265.
Vida Dujmović, Robert Hickingbotham, Jędrzej Hodor, Gwenaël Joret, Hoang La, Piotr Micek, Pat Morin, Clément Rambaud, David R. Wood
The grid-minor theorem revisited, ACM/SIAM Symposium on Discrete Algorithms [SODA], (2024), 1241-1245
264.
Joanna Chybowska-Sokół, Grzegorz Gutowski, Konstanty Junosza-Szaniawski, Patryk Mikos, Adam Polak
Online Coloring of Short Intervals, European Journal of Combinatorics vol. 118 (2024), 103919
263.
Gwenaël Joret, Piotr Micek, Michał Pilipczuk, Bartosz Walczak
Cliquewidth and dimension, ACM/SIAM Symposium on Discrete Algorithms [SODA], (2024), 1437-1446
262.
Jakub Kozik, Piotr Micek, William T. Trotter
Dimension is polynomial in height for posets with planar cover graphs, Journal of Combinatorial Theory. Series B vol. Volume 165, March 2024 (2024), 164-196
261.
Nick Fischer, Piotr Kaliciak, Adam Polak
Deterministic 3SUM-Hardness, Innovations in Theoretical Computer Science [ITCS] vol. 287 (2024), 49:1-49:24
260.
Marcin Briański, James Davies, Bartosz Walczak
Separating polynomial χ-boundedness from χ-boundedness, Combinatorica vol. 44 (2024), 1-8
259.
Paweł Idziak, Piotr Kawałek, Jacek Krzaczkowski, Armin Weiss
Equation satisfiability in solvable groups, Theory of Computing Systems vol. 68 (2024), 740-757
2023
258.
Kevin Beanland, Dmitriy Gorovoy, Jędrzej Hodor, Daniil Homza
Counting unions of Schreier sets, Bulletin of the Australian Mathematical Society vol. 110 (1) (2023), 19-31
257.
Dmitriy Zhuk, Barnaby Martin, Michał Wrona
The complete classification for quantified equality constraints, ACM/SIAM Symposium on Discrete Algorithms [SODA], (2023), 2746-2760
256.
Libor Barto, Bertalan Bodor, Marcin Kozik, Antoine Mottet, Michael Pinsker
Symmetries of Graphs and Structures that Fail to Interpret a Finite Thing, IEEE Symposium on Logic in Computer Science [LICS] vol. brak (2023), 1-13
255.
Jean Cardinal, Kolja Knauer, Piotr Micek, Dömötör Pálvölgyi, Torsten Ueckerdt, Narmada Varadarajan
Colouring bottomless rectangles and arborescences, Computational Geometry: Theory and Applications vol. 115 (2023), 1-17
254.
James Davies, Tomasz Krawczyk, Rose McCarty, Bartosz Walczak
Grounded L-graphs are polynomially χ-bounded, Discrete and Computational Geometry vol. 70 (2023), 1523-1550
253.
Marcin Anholcer, Bartłomiej Bosek, Jarosław Grytczuk, Grzegorz Gutowski, Jakub Przybyło, Rafał Pyzik, Mariusz Zając
On a problem of Steinhaus, Bulletin of the London Mathematical Society vol. 55 (6) (2023), 2635-2652
252.
Marcin Briański, Gwenaël Joret, Konrad Majewski, Piotr Micek, Michał Seweryn, Roohani Sharma
Treedepth vs circumference, Combinatorica vol. 43 (2023), 659-664
251.
Deniz Agaoglu Çagirici, Onur Çagirici, Jan Derbisz, Tim A. Hartmann, Petr Hlinený, Jan Kratochvíl, Tomasz Krawczyk, Peter Zeman
Recognizing H-Graphs - Beyond Circular-Arc Graphs, International Symposium on Mathematical Foundations of Computer Science [MFCS] vol. LIPIcs 272 (2023), 8:1-8:14
250.
Grzegorz Herman, Grzegorz Gawryał
Aggregating Pairwise Information Over Optimal Routes, International Conference on Vehicle Technology and Intelligent Transport Systems [VEHITS], (2023), 344-352
249.
Long-Distance Directional Dial-a-Ride Problems, International Conference on Vehicle Technology and Intelligent Transport Systems [VEHITS], (2023), 187-197
248.
Antonios Antoniadis, Christian Coester, Marek Elias, Adam Polak, Bertrand Simon
Online Metric Algorithms with Untrusted Predictions, ACM Transactions on Algorithms vol. 19 (2023), 1-34
247.
James Davies, Tomasz Krawczyk, Rose McCarty, Bartosz Walczak
Coloring polygon visibility graphs and their generalizations, Journal of Combinatorial Theory. Series B vol. 161 (2023), 268-300
2022
246.
Gwenaël Joret, Piotr Micek
Improved bounds for weak coloring numbers, Electronic Journal of Combinatorics vol. Volume 29, Issue 1 (2022), P1.60
245.
Bartłomiej Bosek, Anna Zych-Pawlewicz
Dynamic Coloring of Unit Interval Graphs with Limited Recourse Budget, European Symposium on Algorithms [ESA], European Symposium on Algorithms [ESA], (2022), 25:1-25:14
244.
Jan Derbisz, Lawqueen Kanesh, Jayakrishnan Madathil, Abhishek Sahu, Saket Saurabh, Shaily Verma
A Polynomial Kernel for Bipartite Permutation Vertex Deletion, Algorithmica vol. 84 (2022), 3246-3275
243.
Marcin Briański, Martin Koutecký, Daniel Král, Kristýna Pekárková, Felix Schröder
Characterization of Matrices with Bounded Graver Bases and Depth Parameters and Applications to Integer Programming, International Colloquium on Automata Languages and Programming [ICALP], (2022), 29:1-29:20
242.
Satisfiability in multi-valued circuits , SIAM Journal on Computing vol. 51(3) (2022), 337-378
241.
Paweł Idziak, Piotr Kawałek, Jacek Krzaczkowski
Complexity of Modular Circuits, IEEE Symposium on Logic in Computer Science [LICS] vol. LICS'22; Proc. of the 37th Annual ACM/IEEE Symposium on Logic in Computer Science (2022), 32:1-32:11
240.
Paweł Idziak, Piotr Kawałek, Jacek Krzaczkowski, Armin Weiss
Satisfiability problems for finite groups, International Colloquium on Automata Languages and Programming [ICALP](MAIN) vol. 229 (2022), 20
239.
Paweł Idziak, Piotr Kawałek, Jacek Krzaczkowski
Satisfiability of Circuits and Equations over Finite Malcev Algebras, International Symposium on Theoretical Aspects of Computer Science [STACS] vol. STACS'22; Proc. of the 39th International Symposium on Theoretical Aspects of Computer Science, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2022), 37:1-37:14
238.
Bartłomiej Bosek, Jarosław Grytczuk, Grzegorz Gutowski, Oriol Serra, Mariusz Zając
Graph Polynomials and Group Coloring of Graphs, European Journal of Combinatorics vol. 102 (2022), 103505
237.
Bartłomiej Bosek, Dariusz Leniowski, Piotr Sankowski, Anna Zych-Pawlewicz
A tight bound for shortest augmenting paths on trees, Theoretical Computer Science vol. 901 (2022), 45-61
236.
Tony Huynh, Gwenaël Joret, Piotr Micek, Michał Seweryn, Paul Wollan
Excludding a Ladder, Combinatorica vol. 42 (2022), 405–432
235.
Łukasz Bożyk, Jan Derbisz, Tomasz Krawczyk, Jana Novotná, Karolina Okrasa
Vertex Deletion into Bipartite Permutation Graphs, Algorithmica vol. 84 (2022), 2271-2291
234.
Libor Barto, Marcin Kozik
Combinatorial Gap Theorem and Reductions between Promise CSPs, ACM/SIAM Symposium on Discrete Algorithms [SODA], (2022), pp.1204 - 1220
2021
233.
Antoine Mottet, Tomáš Nagy, Michael Pinsker, Michał Wrona
Smooth Approximations and Relational Width Collapses, International Colloquium on Automata Languages and Programming [ICALP] vol. LIPIcs 198, Schloss Dagstuhl - Leibniz-Zentrum für Informatik 2021 (2021), 138:1-138:20
232.
Marcin Briański, Jan Gwinner, Vladyslav Hlembotskyi, Witold Jarnicki, Szymon Pliś, Adam Szady
231.
Marcin Briański, Adam Szady
230.
Vida Dujmović, Louis Esperet, Cyril Gavoille, Gwenaël Joret, Piotr Micek, Pat Morin
Adjacency Labelling for Planar Graphs (and Beyond), Journal of the ACM vol. 68 (2021), 1-33
229.
Marcin Briański, Piotr Micek, Michał Pilipczuk, Michał Seweryn
Erdös-Hajnal Properties for Powers of Sparse Graphs, SIAM Journal on Discrete Mathematics vol. 35 (1) (2021), 447-464
228.
Reconfiguring independent sets on interval graphs, International Symposium on Mathematical Foundations of Computer Science [MFCS] vol. Leibniz International Proceedings in Informatics (LIPIcs) 202 (2021), 14
227.
Michał Dębski, Stefan Felsner, Piotr Micek, Felix Schröder
Improved bounds for centered colorings, Advances in Combinatorics (2021), 28
226.
Gwenaël Joret, Piotr Micek, Bruce Reed, Michiel Smid
Tight bounds on the clique chromatic number, Electronic Journal of Combinatorics vol. 28 (2021), P3.51
225.
Bartłomiej Bosek, Jarosław Grytczuk, Barbara Nayar, Bartosz Zaleski
Nonrepetitive List Colorings of the Integers, Annals of Combinatorics vol. 25(2) (2021), 393-403
224.
Hat chromatic number of graphs, Discrete Mathematics vol. 344(12) (2021), 112620
223.
Libor Barto, Zarathustra Brady , Andrei Bulatov, Marcin Kozik, Dmitriy Zhuk
Minimal Taylor Algebras as a Common Framework for the Three Algebraic Approaches to the CSP, IEEE Symposium on Logic in Computer Science [LICS] vol. 1 (2021), 1-13
222.
Jakub Chłędowski, Adam Polak, Bartosz Szabucki, Konrad Żołna
Robust Learning-Augmented Caching: An Experimental Study, International Conference on Machine Learning [ICML], (2021), 1920-1930
221.
James Davies, Tomasz Krawczyk, Rose McCarty, Bartosz Walczak
Colouring polygon visibility graphs and their generalizations, International Symposium on Computational Geometry [SoCG] vol. 189 of Leibniz International Proceedings in Informatics (LIPIcs) (2021), 29:1-29:16
220.
Adam Polak, Adrian Siwiec, Michał Stobierski
Euler Meets GPU: Practical Graph Algorithms with Theoretical Guarantees, IEEE International Parallel and Distributed Processing Symposium (was IPPS and SPDP) [IPDPS], (2021), 233-244
219.
Patryk Mikos
Efficient enumeration of non-isomorphic interval graphs, Discrete Mathematics and Theoretical Computer Science vol. vol. 23 no. 1 (2021),
218.
Lech Duraj, Jakub Kozik, Dmitry A. Shabanov
Random hypergraphs and property B, European Journal of Combinatorics vol. Volume 91, January 2021, 103205 (2021), 1-11
217.
Bartłomiej Bosek, Tomasz Krawczyk
On-line partitioning of width w posets into w^O(log log w) chains, European Journal of Combinatorics vol. 91 (2021), 103202
216.
Csaba Biró, Bartłomiej Bosek, Heather C. Smith, William T. Trotter, Ruidong Wang, Stephen J. Young
Planar Posets that are Accessible from Below Have Dimension at Most 6, Order vol. 38(1) (2021), 21-36
215.
Solving CSPs using weak local consistency, SIAM Journal on Computing vol. 50(4) (2021), 1263-1286
2020
214.
Antonios Antoniadis, Christian Coester, Marek Elias, Adam Polak, Bertrand Simon
Online metric algorithms with untrusted predictions, International Conference on Machine Learning [ICML], (2020),
213.
Lech Duraj, Krzysztof Kleiner, Adam Polak, Virginia Vassilevska Williams
Equivalences between triangle and range query problems, ACM/SIAM Symposium on Discrete Algorithms [SODA], (2020),
212.
Andrea Lincoln, Adam Polak, Virginia Vassilevska Williams
Monochromatic Triangles, Intermediate Matrix Products, and Convolutions, Innovations in Theoretical Computer Science [ITCS], (2020),
211.
Paweł Idziak, Piotr Kawałek, Jacek Krzaczkowski
Intermediate problems in modular circuits satisfiability, IEEE Symposium on Logic in Computer Science [LICS] vol. Association for Computing Machinery (ACM) (2020), 578–590
210.
Joanna Chybowska-Sokół, Grzegorz Gutowski, Konstanty Junosza-Szaniawski, Patryk Mikos, Adam Polak
Online Coloring of Short Intervals, International Workshop on Approximation Algorithms for Combinatorial Optimization Problems [APPROX] vol. 176 (Leibniz International Proceedings in Informatics) (2020), 52:1-52:18
209.
Tony Huynh, Gwenaël Joret, Piotr Micek, David R. Wood
Seymour's Conjecture on 2-Connected Graphs of Large Pathwidth, Combinatorica vol. 40 (2020), 839–868
208.
Łukasz Bożyk, Jan Derbisz, Tomasz Krawczyk, Jana Novotná, Karolina Okrasa
Vertex Deletion into Bipartite Permutation Graphs, International Symposium on Parameterized and Exact Computation (was IWPEC pre 2004) [IPEC] vol. 180 of Leibniz International Proceedings in Informatics, 15th International Symposium on Parameterized and Exact Computation, IPEC 2020, December 14-18, 2020, Hong Kong, China (Virtual Conference) (2020), 5:1-5:16
207.
On The Relational Width of First-Order Expansions of Finitely Bounded Homogeneous Binary Cores with Bounded Strict Width, IEEE Symposium on Logic in Computer Science [LICS] vol. 35TH ANNUAL ACM/IEEE SYMPOSIUM ON LOGIC IN COMPUTER SCIENCE (LICS 2020) (2020), 958-971
206.
Relational Width of First-Order Expansions of Homogeneous Graphs with Bounded Strict Width, International Symposium on Theoretical Aspects of Computer Science [STACS] vol. 154 (LIPIcs) (2020), 39:1-39:16
205.
A Sub-Quadratic Algorithm for the Longest Common Increasing Subsequence Problem, International Symposium on Theoretical Aspects of Computer Science [STACS] vol. 37th International Symposium on Theoretical Aspects of Computer Science (STACS 2020) (2020), 41:1-41:18
204.
Bartłomiej Bosek, Jarosław Grytczuk, William T. Trotter
Local dimension is unbounded for planar posets, Electronic Journal of Combinatorics vol. 27(4) (2020), P4.28
203.
Vida Dujmović, Louis Esperet, Cyril Gavoille, Gwenaël Joret, Piotr Micek, Pat Morin
Adjacency labelling for planar graphs (and beyond), (2020), "2020 IEEE 61st Annual Symposium on Foundations of Computer Science (FOCS)", Institute of Electrical and Electronics Engineers (IEEE)
202.
Vida Dujmović, Gwenaël Joret, Piotr Micek, Pat Morin, Torsten Ueckerdt, David R. Wood
Planar Graphs Have Bounded Queue-Number, Journal of the ACM vol. 67(4) (2020), 862-875
201.
Stefan Felsner, Tamás Mészáros, Piotr Micek
Boolean Dimension and Tree-Width, Combinatorica vol. 40 (2020), 655-677
200.
Michał Dębski, Stefan Felsner, Piotr Micek, Felix Schröder
Improved bounds for centered colorings vol. SODA '20 (2020), "Proceedings of the Thirty-First Annual ACM-SIAM Symposium on Discrete Algorithms", Society for Industrial and Applied Mathematics (SIAM)
199.
Tamás Mészáros, Piotr Micek, William T. Trotter
Boolean Dimension, Components and Blocks, Order (2020), 287-298
198.
Libor Barto, Tan Johnson, Marcin Kozik, Matthew Valeriote
Sensitive Instances of the Constraint Satisfaction Problem, International Colloquium on Automata Languages and Programming [ICALP](MAIN), (2020), 110:1-110:18
197.
Piotr Kawałek, Jacek Krzaczkowski
Even faster algorithms for CSAT over supernilpotent algebras, International Symposium on Mathematical Foundations of Computer Science [MFCS] vol. 170 (2020), 55:1-55:13
196.
Faster general parsing through context-free memoization, ACM-SIGPLAN Conference on Programming Language Design and Implementation [PLDI], (2020), 1022-1035
195.
Bartłomiej Bosek, Yann Disser, Andreas Emil Feldmann, Jakub Pawlewicz, Anna Zych-Pawlewicz
Recoloring Interval Graphs with Limited Recourse Budget vol. 162 (2020), "17th Scandinavian Symposium and Workshops on Algorithm Theory, SWAT 2020, June 22-24, 2020, Tórshavn, Faroe Islands", Schloss Dagstuhl – Leibniz-Zentrum für Informatik
194.
Antonios Antoniadis, Christian Coester, Marek Elias, Adam Polak, Bertrand Simon
Online metric algorithms with untrusted predictions, International Conference On Machine Learning (icml) vol. 119 (2020), 345–355
193.
Michał Seweryn
192.
Andrea Lincoln, Adam Polak, Virginia Vassilevska Williams
Monochromatic Triangles, Intermediate Matrix Products, and Convolutions, 11th Innovations in Theoretical Computer Science Conference (itcs 2020) vol. 151 (Leibniz International Proceedings in Informatics (LIPIcs)) (2020), 53:1-53:18
191.
Lech Duraj, Krzysztof Kleiner, Adam Polak, Virginia Vassilevska Williams
Equivalences between triangle and range query problems, Acm-siam Symposium On Discrete Algorithms 2020 (soda'20) (2020), 30-47
2019
190.
Miron Ficak, Marcin Kozik, Miroslav Olsak, Szymon Stankiewicz
Dichotomy for symmetric boolean PCSPs, International Colloquium on Automata Languages and Programming [ICALP](MAIN), (2019), 57:1-57:12
189.
Vida Dujmović, Gwenaël Joret, Piotr Micek, Pat Morin, Torsten Ueckerdt, David R. Wood
Planar Graphs have Bounded Queue-Number, (2019), "2019 IEEE 60th Annual Symposium on Foundations of Computer Science (FOCS)", Institute of Electrical and Electronics Engineers (IEEE)
188.
Gal Kronenberg, Christopher Kusch, Ander Lamaison, Piotr Micek, Tuan Tran
A note on the minimum number of edges in hypergraphs with property O, European Journal of Combinatorics vol. 81 (2019), 172-177
187.
Fidel Barrera-Cruz, Stefan Felsner, Tamás Mészáros, Piotr Micek, Heather C. Smith, Libby Taylor, William T. Trotter
Separating tree-chromatic number from path-chromatic number, Journal of Combinatorial Theory. Series B vol. 138 (2019), 206-218
186.
Gwenaël Joret, Piotr Micek, Patrice Ossona de Mendez, Veit Wiechert
Nowhere dense graph classes and dimension, Combinatorica (2019), 1055-1079
185.
Victor Dalmau, Marcin Kozik, Andrei Krokhin, Konstantin Makarychev, Yury Makarychev, Jakub Oprsal
Robust Algorithms with Polynomial Loss for Near-Unanimity CSPs, SIAM Journal on Computing vol. 48(6) (2019), 1763–1795
184.
Marcin Anholcer, Bartłomiej Bosek, Jarosław Grytczuk
Majority coloring of infinite digraphs, Acta Mathematica Universitatis Comenianae vol. 88 (3) (2019), 371-376
183.
Smaller Universal Targets for Homomorphisms of Edge-Colored Graphs, Computing and Combinatorics, 25th International Conference, Cocoon 2019, Xi'an, China, July 29–31, 2019, Proceedings vol. 11653 (2019), 232-239
182.
Akanksha Agrawal, Grzegorz Guśpiel, Jayakrishnan Madathil, Saket Saurabh, Meirav Zehavi
Connecting the Dots (with Minimum Crossings), 35th International Symposium On Computational Geometry vol. 129 (2019), 7:1-7:17
181.
Lech Duraj, Marvin Künnemann, Adam Polak
180.
179.
Bartłomiej Bosek, Michał Farnik, Jarosław Grytczuk, Sebastian Czerwiński, Tomasz Bartnicki, Zofia Miechowicz
Generalized arboricity of graphs with large girth, Discrete Mathematics vol. 342(5) (2019), 1343-1350
178.
Marcin Anholcer, Bartłomiej Bosek, Jarosław Grytczuk
Weight choosability of oriented hypergraphs, ARS Mathematica Contemporanea vol. 16 (1) (2019), 111-117
177.
Bartłomiej Bosek, Jarosław Grytczuk, Gabriel Jakóbczak
Majority coloring game, Discrete Applied Mathematics vol. 255 (2019), 15-20
2018
176.
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
175.
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
174.
Gwenaël Joret, Piotr Micek, Veit Wiechert
Sparsity and dimension, Combinatorica vol. 38 (2018), 1129-1148
173.
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
172.
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
171.
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
170.
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
169.
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)
168.
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
167.
Alexandr Kazda, Marcin Kozik, Ralph McKenzie, Matthew Moore
Absorption and directed Jónsson terms, (2018), "Don Pigozzi on Abstract Algebraic Logic", Springer
166.
Grzegorz Gutowski, Ming Han, Tomasz Krawczyk, Xuding Zhu
Defective 3-Paintability of Planar Graphs, Electronic Journal of Combinatorics vol. 25 (2) (2018), 20
165.
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
164.
Deferred On-Line Bipartite Matching, Electronic Journal of Combinatorics vol. 25 (2) (2018), P2.24
163.
Patryk Mikos
A new lower bound for the on-line coloring of intervals with bandwidth, Theoretical Computer Science vol. 708 (2018), 96-100
162.
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
161.
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
160.
Karol Kosiński, Robert Mercas, Dirk Nowotka
159.
158.
On an Extremal Problem for Poset Dimension, Order vol. 35(3) (2018), 489-493
157.
Steven Chaplick, Grzegorz Guśpiel, Grzegorz Gutowski, Tomasz Krawczyk, Giuseppe Liotta
The Partial Visibility Representation Extension Problem, Algorithmica vol. 80 (8) (2018), 2286-2323
2017
156.
Gwenaël Joret, Piotr Micek, William T. Trotter, Ruidong Wang, Veit Wiechert
On the Dimension of Posets with Cover Graphs of Treewidth 2, Order vol. 34.2 (2017), 185-234
155.
Piotr Micek, Veit Wiechert
Topological minors of cover graphs and dimension, Journal of Graph Theory vol. 86.3 (2017), 295–314
154.
Stefan Felsner, Gwenaël Joret, Piotr Micek, William T. Trotter, Veit Wiechert
Burling graphs, chromatic number, and orthogonal tree-decompositions, Electronic Notes in Discrete Mathematics vol. 61 (2017), 415-420
153.
Gwenaël Joret, Piotr Micek, Veit Wiechert
Planar posets have dimension at most linear in their height, SIAM Journal on Discrete Mathematics vol. 31 (4) (2017), 2754–2790
152.
Tomasz Krawczyk, Bartosz Walczak
On-line approach to off-line coloring problems on graphs with geometric representations, Combinatorica vol. 37 (2017), 1139-1179
151.
Tomasz Krawczyk, Bartosz Walczak
Extending partial representations of trapezoid graphs vol. 10520 of Lecture Notes in Computer Science (2017), "Graph-Theoretic Concepts in Computer Science, 43rd International Workshop, WG 2017, Eindhoven, The Netherlands, June 21-23, 2017, Revised Selected Papers", Springer
150.
Marcin Anholcer, Bartłomiej Bosek, Jarosław Grytczuk
Majority Choosability of Digraphs, Electronic Journal of Combinatorics vol. 24(3) (2017), #P3.57
149.
148.
Uniform Cross-entropy Clustering, Schedae Informaticae vol. 25 (2017), 117-126
147.
146.
The Complexity of Minimal Inference Problem for Conservative Constraint Languages. Proceedings of the Annual ACM/IEEE Symposium on Logic in Computer Science (LICS)., IEEE Symposium on Logic in Computer Science [LICS], (2017),
145.
Minimal Inference Problem over Finite Domains: The Landscape of Complexity. Procedings of the International Conference on Logic Programming and Nonmonotonic Reasoning (LPNMR)., International Conference on Logic Programming and Non-monotonic Reasoning [LPNMR], (2017),
144.
Barnaby Martin, Andras Pongracz, Michał Wrona
The Complexity of Counting Quantifiers on Equality Languages, Theoretical Computer Science vol. 670 (2017), 56–67
143.
Libor Barto, Marcin Kozik
Absorption in Universal Algebra and CSP, (2017), "The Constraint Satisfaction Problem: Complexity and Approximability", Schloss Dagstuhl – Leibniz-Zentrum für Informatik
142.
Victor Dalmau, Marcin Kozik, Andrei Krokhin, Konstantin Makarychev, Yury Makarychev, Jakub Oprsal
Robust algorithms with polynomial loss for near-unanimity CSPs, Proceedings of the 28th Annual Acm-siam Symposium On Discrete Algorithms Soda'17 (2017), 340-357
141.
Piotr Micek, Veit Wiechert
An On-line Competitive Algorithm for Coloring Bipartite Graphs Without Long Induced Paths, Algorithmica vol. 77 (2017), 1060-1070
2016
140.
Barnaby Martin, Andras Pongracz, Michał Wrona
The Complexity of Counting Quantifiers on Equality Languages, Lecture Notes in Computer Science vol. 9709 (2016), 333-342
139.
Gwenaël Joret, Piotr Micek, Veit Wiechert
Sparsity and dimension, (2016), "27th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA 2016), January 10-12, 2016, Arlington, VA, USA", Society for Industrial and Applied Mathematics (SIAM)
138.
Steven Chaplick, Piotr Micek, Torsten Ueckerdt, Veit Wiechert
A note on concurrent graph sharing games, Integers vol. Volume 16, G1 (2016), 5
137.
Pathwidth and nonrepetitive list colorings, Electronic Journal of Combinatorics vol. Volume 23, Issue 4 (2016), 19
136.
Steven Chaplick, Grzegorz Guśpiel, Grzegorz Gutowski, Tomasz Krawczyk, Giuseppe Liotta
The Partial Visibility Representation Extension Problem vol. 9801 (Lecture Notes in Computer Science) (2016), "Graph Drawing and Network Visualization, 24th International Symposium, GD 2016, Athens, Greece, September 19-21, 2016, Revised Selected Papers", Springer
135.
Andrei Bulatov, Marcin Kozik, Peter Mayr, Markus Steindl
The subpower membership problem for semigroups, International Journal of Algebra and Computation vol. 26 (2016), 1435-1451
134.
Chip Games and Paintability, Electronic Journal of Combinatorics vol. 23 (3) (2016), 12
133.
Adam Karczmarz, Jakub Łącki, Adam Polak, Jakub Radoszewski, Jakub Onufry Wojtaszczyk
Distributed Tasks: Introducing Distributed Computing to Programming Competitions, Olympiads in Informatics vol. 10 (2016), 177-194
132.
Counting Triangles in Large Graphs on GPU, 2016 Ieee International Parallel and Distributed Processing Symposium Workshops (ipdpsw) (2016), 740-746
131.
Bartłomiej Bosek, Jarosław Grytczuk, Paweł Rzążewski, Sebastian Czerwiński
Harmonious coloring of uniform hypergraphs, Applicable Analysis and Discrete Mathematics vol. 10(1) (2016), 73-87
130.
Weak consistency notions for all CSPs of bounded width, Proceedings of the 31st Annual Acm/ieee Symposium On Logic in Computer Science (lics'16) (2016), 633-641
129.
Libor Barto, Marcin Kozik
Robustly Solvable Constraint Satisfaction Problems, SIAM Journal on Computing vol. 45(4) (2016), 1646–1669
128.
Bartłomiej Bosek, Dariusz Leniowski, Piotr Sankowski, Anna Zych
Shortest Augmenting Paths for Online Matchings on Trees, Lecture Notes in Computer Science vol. 9499 (2016), 59-71
127.
Gwenaël Joret, Piotr Micek, Kevin G. Milans, William T. Trotter, Bartosz Walczak, Ruidong Wang
Tree-width and dimension, Combinatorica vol. 36 (2016), 431-450
126.
Jarosław Grytczuk, Karol Kosiński, Michał Zmarz
Nonrepetitive colorings of line arrangements, European Journal of Combinatorics vol. 51 (2016), 275-279
125.
Bartłomiej Bosek, Stefan Felsner, Kolja Knauer, Grzegorz Matecki
On the Duality of Semiantichains and Unichain Coverings, Order vol. 33(1) (2016), 29-38
2015
124.
Tomasz Krawczyk, Bartosz Walczak
Asymmetric coloring games on incomparability graphs vol. 49 of Electronic Notes in Discrete Mathematics (2015), "The Eight European Conference on Combinatorics, Graph Theory and Applications, EuroComb 2015", Elsevier Science
123.
Marcin Kozik, Joanna Ochremiak
Algebraic Properties of Valued Constraint Satisfaction Problem, Proceedings of 42nd International Colloquium, Icalp 2015 (2015), 846-858
122.
On-line coloring between two lines vol. 34 of Leibniz International Proceedings in Informatics (2015), "31st International Symposium on Computational Geometry, SoCG 2015, June 22-25, 2015, Eindhoven, The Netherlands", Schloss Dagstuhl – Leibniz-Zentrum für Informatik
121.
Libor Barto, Marcin Kozik, David Stanovský
Mal’tsev conditions, lack of absorption, and solvability, Algebra Universalis vol. 74 (2015), 185-206
120.
Marcin Kozik, Andrei Krokhin, Matthew Valeriote, Ross Willard
Characterizations of several Maltsev conditions, Algebra Universalis vol. 73 (2015), 205-224
119.
Jarosław Grytczuk, Karol Kosiński, Michał Zmarz
How to Play Thue Games, Theoretical Computer Science vol. 582 (2015), 83-88
118.
A note on locality of algebras, Journal of Algebra vol. 433 (2015), 231-242
117.
Andrzej Grzesik, Michał Morayne, Małgorzata Sulkowska
116.
Andrzej Grzesik, Mirjana Mikalački, Zoltán Lóránt Nagy, Alon Naor, Balázs Patkós, Fiona Skerman
Avoider-Enforcer star games, Discrete Mathematics and Theoretical Computer Science vol. 17(1) (2015), 145-160
115.
Michał Dębski, Jarosław Grytczuk, Małgorzata Śleszyńska-Nowak
The strong chromatic index of sparse graphs, Information Processing Letters vol. 115 (2015), 326–330
114.
Jarosław Grytczuk, Wojciech Lubawski
113.
Bartłomiej Bosek, Tomasz Krawczyk
A subexponential upper bound for the on-line chain partitioning problem, Combinatorica vol. 35 (2015), 1-38
112.
Tomasz Krawczyk, Arkadiusz Pawlik, Bartosz Walczak
111.
Roman Glebov, Andrzej Grzesik, Tereza Klimošová, Daniel Král
Finitely forcible graphons and permutons, Journal of Combinatorial Theory. Series B vol. 110 (2015), 112-135
2014
110.
Tractability Frontier for Dually-Closed Ord-Horn Quantified Constraint Satisfaction Problems, Lecture Notes in Computer Science vol. 8634 (Springer) (2014), 535-546
109.
Local-to-Global Consistency Implies Tractability of Abduction. Proceedings of the Twenty-Eighth AAAI Conference on Artificial Intelligence., Proceedings of the Twenty-eighth Aaai Conference On Artificial Intelligence (2014), 1128-1134
108.
Manuel Bodirsky, Hubie Chen, Michał Wrona
Tractability of quantified temporal constraints to the max, International Journal of Algebra and Computation vol. 24 (2014), 1141-1156
107.
106.
Piotr Micek, Veit Wiechert
An on-line competitive algorithm for coloring P_8-free bipartite graphs, (2014), "Algorithms and Computation -- 25th International Symposium, ISAAC 2014, Jeonju, Korea, December 15-17, 2014, Proceedings", Springer
105.
Lower Bounds for On-Line Graph Colorings vol. 8889 (Lecture Notes in Computer Science) (2014), "Algorithms and Computation, 25th International Symposium, ISAAC 2014, Jeonju, Korea, December 15-17, 2014, Proceedings", Springer
104.
Jean Cardinal, Kolja Knauer, Piotr Micek, Torsten Ueckerdt
Making octants colorful, and related covering decomposition problems, (2014), "Proceedings of the Twenty-Fifth Annual ACM-SIAM Symposium on Discrete Algorithms (SODA 2014)", Society for Industrial and Applied Mathematics (SIAM)
103.
Jean Cardinal, Kolja Knauer, Piotr Micek, Torsten Ueckerdt
Making octants colorful, and related covering decomposition problems, SIAM Journal on Discrete Mathematics vol. 28-4 (2014), 1948-1959
102.
Libor Barto, Marcin Kozik
Constraint Satisfaction Problems Solvable by Local Consistency Methods, Journal of the ACM vol. 61 (2014), article no. 3
101.
Bartłomiej Bosek, Dariusz Leniowski, Piotr Sankowski, Anna Zych
Online bipartite matching in offline time, (2014), "55th Annual IEEE Symposium on Foundations of Computer Science, FOCS 2014, October 18-21, 2014, Philadelphia, PA, USA", Institute of Electrical and Electronics Engineers (IEEE)
100.
Andrzej Grzesik, Hrant Khachatrian
Interval edge-colorings of K_{1,m,n}, Discrete Applied Mathematics vol. 174 (2014), 140-145
99.
98.
An extremal problem on crossing vectors, Journal of Combinatorial Theory - Series A vol. 128 (2014), 41-55
97.
Tomasz Krawczyk, Bartosz Walczak
Coloring relatives of interval overlap graphs via on-line games vol. 8572 of Lecture Notes in Computer Science (2014), "Automata, Languages, and Programming, 41st International Colloquium, ICALP 2014, Copenhagen, Denmark, July 8-11, 2014, Proceedings, Part I", Springer
96.
Arkadiusz Pawlik, Jakub Kozik, Tomasz Krawczyk, Michał Lasoń, Piotr Micek, William T. Trotter, Bartosz Walczak
95.
Kolja Knauer, Piotr Micek, Bartosz Walczak
Outerplanar graph drawings with few slopes, Computational Geometry: Theory and Applications vol. 47 (2014), 614-624
94.
Jakub Kozik, Piotr Micek, Xuding Zhu
Towards an on-line version of Ohba’s conjecture, European Journal of Combinatorics vol. 36 (2014), 110-121
93.
Bartłomiej Bosek, Jarosław Grytczuk, Grzegorz Matecki, Sebastian Czerwiński, Tomasz Bartnicki, Wiktor Żelazny
Additive Coloring of Planar Graphs, Graphs and Combinatorics vol. 30(5) (2014), 1087-1098
2013
92.
Johannes Schmidt, Michał Wrona
The Complexity of Abduction for Equality Constraint Languages, Lipics–leibniz International Proceedings in Informatics vol. 23 (2013), 615-633
91.
Jean Cardinal, Kolja Knauer, Piotr Micek, Torsten Ueckerdt
Making triangles colorful, Journal of Computational Geometry vol. 4 (2013), 240-246
90.
Andrei Asinowski, Jean Cardinal, Nathann Cohen, Sébastien Collette, Günter Rote, Thomas Hackl, Michael Hoffman, Kolja Knauer, Stefan Langerman, Michał Lasoń, Piotr Micek, Torsten Ueckerdt
89.
Polynomial-time locality tests for finite rings, Journal of Algebra vol. 379 (2013), 441-452
88.
Tomasz Krawczyk, Arkadiusz Pawlik, Bartosz Walczak
Coloring triangle-free rectangular frame intersection graphs with O(log log n) colors vol. 8165 of Lecture Notes in Computer Science (2013), "Graph-Theoretic Concepts in Computer Science, 39th International Workshop, WG 2013, Lübeck, Germany, June 19-21, 2013, Revised Papers", Springer
Przejdź do strony: