Instytut Informatyki Analitycznej - lista publikacji

1-200 z 357.

2022

357.
Libor Barto, Marcin Kozik
Combinatorial Gap Theorem and Reductions between Promise CSPs, ACM/SIAM SYMPOSIUM ON DISCRETE ALGORITHMS [SODA], (2022),

2021

355.
Marek Kubale, Tytus Pikies, Krzysztof Turowski
Scheduling with Complete Multipartite Incompatibility Graph on Parallel Machines, INTERNATIONAL CONFERENCE ON AUTOMATED PLANNING AND SCHEDULING [ICAPS], (2021), 262-270
354.
Jana Novotná, Karolina Okrasa, Michał Pilipczuk, Paweł Rzążewski, Erik Jan van Leeuwen, Bartosz Walczak
353.
Vida Dujmović, Louis Esperet, Cyril Gavoille, Gwenaël Joret, Piotr Micek, Pat Morin
351.
Marcin Briański, Stefan Felsner, Jędrzej Hodor, Piotr Micek
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
350.
Michał Dębski, Stefan Felsner, Piotr Micek, Felix Schröder
Improved bounds for centered colorings, ADVANCES IN COMBINATORICS (2021), 28
349.
Gwenaël Joret, Piotr Micek, Bruce Reed, Michiel Smid
348.
Bartłomiej Bosek, Jarosław Grytczuk, Barbara Nayar, Bartosz Zaleski
347.
Bartłomiej Bosek, Andrzej Dudek, Michał Farnik, Jarosław Grytczuk, Przemysław Mazur
Hat chromatic number of graphs., DISCRETE MATH vol. 344 (12) (2021), 112620
346.
Antoine Mottet, Tomáš Nagy, Michael Pinsker, Michał Wrona
Smooth Approximations and Relational Width Collapses, THE PROCEEDINGS OF 48TH INTERNATIONAL COLLOQUIUM ON AUTOMATA, LANGUAGES, AND PROGRAMMING, ICALP 2021 vol. LIPIcs 198, Schloss Dagstuhl - Leibniz-Zentrum für Informatik 2021 (2021), 138:1-138:20
345.
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
344.
Robust Learning-Augmented Caching: An Experimental Study, INTERNATIONAL CONFERENCE ON MACHINE LEARNING [ICML], (2021), 1920--1930
342.
Torsten Mütze, Jerri Nummenpalo, Bartosz Walczak
341.
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
340.
Improving Gebauer’s construction of 3-chromatic hypergraphs with few edges, INTERNATIONAL COLLOQUIUM ON AUTOMATA LANGUAGES AND PROGRAMMING [ICALP] vol. Leibniz International Proceedings in Informatics (LIPIcs) (2021), 89:1-89:9
339.
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),
336.
333.
Robert Janczewski, Anna Maria Trzaskowska, Krzysztof Turowski
332.
Carla Groenland, Gwenaël Joret, Wojciech Nadara, Bartosz Walczak
Approximating pathwidth for graphs of small treewidth, ACM/SIAM SYMPOSIUM ON DISCRETE ALGORITHMS [SODA], (2021), 1965-1976
331.
Parinya Chalermsook, Bartosz Walczak
Coloring and maximum weight independent set of rectangles, ACM/SIAM SYMPOSIUM ON DISCRETE ALGORITHMS [SODA], (2021), 860-868
330.
Lech Duraj, Jakub Kozik, Dmitry A. Shabanov
Random hypergraphs and property B, EUR J COMBIN vol. Volume 91, January 2021, 103205 (2021), 1-11
328.
Csaba Biró, Bartłomiej Bosek, Heather C. Smith, William T. Trotter, Ruidong Wang, Stephen J. Young

2020

326.
Jithin K. Sreedharan, Wojciech Szpankowski, Krzysztof Turowski
Temporal Ordered Clustering in Dynamic Networks, IEEE INTERNATIONAL SYMPOSIUM ON INFORMATION THEORY [ISIT], (2020), 1349-1354
325.
Philippe Jacquet, Wojciech Szpankowski, Krzysztof Turowski
Power-Law Degree Distribution in the Connected Component of a Duplication Graph, INTERNATIONAL CONFERENCE ON PROBABILISTIC, COMBINATORIAL, AND ASYMPTOTIC METHODS IN THE ANALYSIS OF ALGORITHMS [AOFA], (2020), 16:1-16:14
324.
Tony Huynh, Gwenaël Joret, Piotr Micek, David R. Wood
323.
Ł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
322.
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
321.
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
320.
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
319.
Bartłomiej Bosek, Jarosław Grytczuk, William T. Trotter
318.
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)
317.
Vida Dujmović, Gwenaël Joret, Piotr Micek, Pat Morin, Torsten Ueckerdt, David R. Wood
316.
Stefan Felsner, Tamás Mészáros, Piotr Micek
315.
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)
314.
Tamás Mészáros, Piotr Micek, William T. Trotter
313.
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
312.
Abram Magner, Wojciech Szpankowski, Krzysztof Turowski
311.
Even faster algorithms for CSAT over supernilpotent algebras, INTERNATIONAL SYMPOSIUM ON MATHEMATICAL FOUNDATIONS OF COMPUTER SCIENCE [MFCS] vol. 170 (2020), 55:1--55:13
310.
Faster general parsing through context-free memoization, ACM-SIGPLAN CONFERENCE ON PROGRAMMING LANGUAGE DESIGN AND IMPLEMENTATION [PLDI], (2020), 1022-1035
309.
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
308.
Zofia Kostrzycka, Marek Zaionc
Quantitative Study of Fuzzy Logics, 2020 IEEE INTERNATIONAL CONFERENCE ON FUZZY SYSTEMS (FUZZ-IEEE) (2020), 1-8
307.
Intermediate problems in modular circuits satisfiability, (2020), "LICS '20: Proceedings of the 35th Annual ACM/IEEE Symposium on Logic in Computer Science", Association for Computing Machinery (ACM)
306.
Grzegorz Gutowski, Konstanty Junosza-Szaniawski, Patryk Mikos, Adam Polak, Joanna Sokół
Online Coloring of Short Intervals, INTERNATIONAL WORKSHOP ON APPROXIMATION ALGORITHMS FOR COMBINATORIAL OPTIMIZATION PROBLEMS (APPROX) vol. 176 (2020), 52:1–52:18
305.
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
304.
Vida Dujmović, Louis Esperet, Gwenaël Joret, Bartosz Walczak, David R. Wood
Planar graphs have bounded nonrepetitive chromatic number, ADVANCES IN COMBINATORICS vol. 2020 (2020), 5:1-11
302.
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
301.
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

300.
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
299.
Philippe Jacquet, Wojciech Szpankowski, Krzysztof Turowski
Asymptotics of Entropy of the Dirichlet-Multinomial Distribution, IEEE INTERNATIONAL SYMPOSIUM ON INFORMATION THEORY [ISIT], (2019), 1517-1521
298.
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)
297.
Gal Kronenberg, Christopher Kusch, Ander Lamaison, Piotr Micek, Tuan Tran
296.
Fidel Barrera-Cruz, Stefan Felsner, Tamás Mészáros, Piotr Micek, Heather C. Smith, Libby Taylor, William T. Trotter
295.
Gwenaël Joret, Piotr Micek, Patrice Ossona de Mendez, Veit Wiechert
294.
Robert Janczewski, Paweł Obszarski, Krzysztof Turowski
2-Coloring number revisited, THEOR COMPUT SCI vol. 796 (2019), 187-195
293.
Neininger Ralph, Hwang, Hsien-Kuei
Preface, COMB PROBAB COMPUT vol. 28(4) (2019), 483-484
292.
Victor Dalmau, Marcin Kozik, Andrei Krokhin, Konstantin Makarychev, Yury Makarychev, Jakub Oprsal
291.
Jana Novotná, Karolina Okrasa, Michał Pilipczuk, Paweł Rzążewski, Erik Jan van Leeuwen, Bartosz Walczak
Subexponential-time algorithms for finding large induced sparse subgraphs vol. 148 of Leibniz International Proceedings in Informatics (2019), "14th International Symposium on Parameterized and Exact Computation, IPEC 2019, September 11-13, 2019, Munich, Germany", Schloss Dagstuhl – Leibniz-Zentrum für Informatik
290.
Alexandre Rok, Bartosz Walczak
288.
Marcin Anholcer, Bartłomiej Bosek, Jarosław Grytczuk
Majority coloring of infinite digraphs, ACTA MATHEMATICA UNIVERSITATIS COMENIANAE vol. 88 (3) (2019), 371-376
286.
Maciej Bendkowski, Olivier Bodini, Sergey Dovgal
285.
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
284.
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
283.
Towards the average-case analysis of substitution resolution in λ-calculus vol. Leibniz International Proceedings in Informatics (LIPIcs) (2019), "4th International Conference on Formal Structures for Computation and Deduction (FSCD 2019)", Schloss Dagstuhl – Leibniz-Zentrum für Informatik
279.
Bartłomiej Bosek, Michał Farnik, Jarosław Grytczuk, Sebastian Czerwiński, Tomasz Bartnicki, Zofia Miechowicz
278.
David M. Howard, Noah Streib, William T. Trotter, Bartosz Walczak, Ruidong Wang
277.
Marcin Anholcer, Bartłomiej Bosek, Jarosław Grytczuk
276.
Bartłomiej Bosek, Jarosław Grytczuk, Gabriel Jakóbczak
Majority coloring game, DISCRETE APPL MATH vol. 255 (2019), 15-20

2018

275.
A note on two-colorability of nonuniform hypergraphs, INTERNATIONAL COLLOQUIUM ON AUTOMATA LANGUAGES AND PROGRAMMING [ICALP] vol. 45th International Colloquium on Automata, Languages, and Programming (ICALP 2018) (2018), 46:1--46:13
274.
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
273.
Gwenaël Joret, Piotr Micek, Veit Wiechert
Sparsity and dimension, COMBINATORICA vol. 38 (2018), 1129-1148
272.
Abram Magner, Wojciech Szpankowski, Krzysztof Turowski
270.
Stefan Felsner, Gwenaël Joret, Piotr Micek, William T. Trotter, Veit Wiechert
269.
Bartłomiej Bosek, Przemysław Gordinowicz, Jarosław Grytczuk, Nicolas Nisse, Joanna Sokół, Małgorzata Śleszyńska-Nowak
Centroidal Localization Game, ELECTRON J COMB vol. 25 (4) (2018), 1-19
266.
Bartłomiej Bosek, Przemysław Gordinowicz, Jarosław Grytczuk, Nicolas Nisse, Joanna Sokół, Małgorzata Śleszyńska-Nowak
265.
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
264.
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)
263.
Maciej Bendkowski, Pierre Lescanne
Combinatorics of explicit substitutions vol. PPDP '18 (2018), "Proceedings of the 20th International Symposium on Principles and Practice of Declarative Programming", Association for Computing Machinery (ACM)
262.
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
261.
Maciej Bendkowski, Pierre Lescanne
Counting Environments and Closures vol. Leibniz International Proceedings in Informatics (LIPIcs) (2018), "3rd International Conference on Formal Structures for Computation and Deduction (FSCD 2018)", Schloss Dagstuhl – Leibniz-Zentrum für Informatik
260.
Torsten Mütze, Jerri Nummenpalo, Bartosz Walczak
Sparse Kneser graphs are Hamiltonian, (2018), "Proceedings of 50th Annual ACM SIGACT Symposium on the Theory of Computing (STOC’18)", Association for Computing Machinery (ACM)
258.
Alexandr Kazda, Marcin Kozik, Ralph McKenzie, Matthew Moore
Absorption and directed Jónsson terms, (2018), "Don Pigozzi on Abstract Algebraic Logic", Springer
256.
William T. Trotter, Bartosz Walczak, Ruidong Wang
Dimension and cut vertices: an application of Ramsey theory, (2018), "Connections in Discrete Mathematics: A Celebration of the Work of Ron Graham", Cambridge University Press
251.
Bartłomiej Bosek, Dariusz Leniowski, Piotr Sankowski, Anna Zych-Pawlewicz
250.
Bartłomiej Bosek, Michał Dębski, Jarosław Grytczuk, Joanna Sokół, Małgorzata Śleszyńska-Nowak, Wiktor Żelazny
249.
Maciej Bendkowski, Olivier Bodini, Sergey Dovgal
Polynomial tuning of multiparametric combinatorial samplers, (2018), "2018 Proceedings of the Fifteenth Workshop on Analytic Algorithmics and Combinatorics (ANALCO)", Society for Industrial and Applied Mathematics (SIAM)
244.

2017

242.
Jacek Cichoń, Abram Magner, Wojciech Szpankowski, Krzysztof Turowski
On Symmetries of Non-Plane Trees in a Non-Uniform Model, WORKSHOP ON ANALYTIC ALGORITHMICS AND COMBINATORICS [ANALCO], (2017), 156-163
241.
William T. Trotter, Bartosz Walczak
Boolean dimension and local dimension vol. 61 of Electronic Notes in Discrete Mathematics (2017), "The Ninth European Conference on Combinatorics, Graph Theory and Applications, EuroComb 2017", Elsevier Science
240.
Gwenaël Joret, Piotr Micek, William T. Trotter, Ruidong Wang, Veit Wiechert
239.
Piotr Micek, Veit Wiechert
238.
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
237.
Gwenaël Joret, Piotr Micek, Veit Wiechert
235.
Asymptotic density in logic and computability, PROCEEDINGS OF THE TENTH WORKSHOP ON INFORMATION THEORETIC METHODS IN SCIENCE AND ENGINEERING, PARIS, FRANCE, SEPTEMBER 11-13, 2017 vol. Publication series B, Report B-2017-3 (Editors: Jacquet Philippe, Leppä-Aho Janne, Roos Teemu (2017), 43
234.
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
233.
Marcin Anholcer, Bartłomiej Bosek, Jarosław Grytczuk
232.
Alexandre Rok, Bartosz Walczak
Coloring curves that cross a fixed curve vol. 77 of Leibniz International Proceedings in Informatics (2017), "33rd International Symposium on Computational Geometry, SoCG 2017, July 4-7, 2017, Brisbane, Australia", Schloss Dagstuhl – Leibniz-Zentrum für Informatik
231.
Combinatorics of λ-terms: a natural approach, J LOGIC COMPUT vol. Volume 27, Issue 8 (2017), 2611–2630
225.
Barnaby Martin, Andras Pongracz, Michał Wrona
224.
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
223.
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
221.
Lower Bounds for On-line Interval Coloring with Vector and Cardinality Constraints vol. 10139 (Lecture Notes in Computer Science) (2017), "SOFSEM 2017: Current Trends in Theory and Practice of Computer Science, 43rd International Conference, Limerick, Ireland, January 16-20, 2017, Proceedings", Springer
219.
Martin Balko, Vít Jelínek, Pavel Valtr, Bartosz Walczak
218.

2016

216.
Lossless compression of binary trees with correlated vertex names, IEEE INTERNATIONAL SYMPOSIUM ON INFORMATION THEORY [ISIT], (2016), 1217-1221
215.
212.
Vida Dujmović, Gwenaël Joret, Jakub Kozik, David R. Wood
Nonrepetitive colouring via entropy compression, COMBINATORICA vol. Volume 36, Issue 6 (2016), 661-686
211.
Piotr Danilewski, Philipp Slusallek
Building Code with Dynamic Staging, THE COMPUTING RESEARCH REPOSITORY (2016), 11
210.
Piotr Danilewski, Philipp Slusallek
ManyDSL: A Host for Many Languages, THE COMPUTING RESEARCH REPOSITORY (2016), 14
208.
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)
207.
Steven Chaplick, Piotr Micek, Torsten Ueckerdt, Veit Wiechert
A note on concurrent graph sharing games, INTEGERS vol. Volume 16, G1 (2016), 5
206.
Adam Gągol, Gwenaël Joret, Jakub Kozik, Piotr Micek
Pathwidth and nonrepetitive list colorings, ELECTRON J COMB vol. Volume 23, Issue 4 (2016), 19
205.
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
204.
Andrei Bulatov, Marcin Kozik, Peter Mayr, Markus Steindl
202.
Mikkel Abrahamsen, Bartosz Walczak
Outer common tangents and nesting of convex hulls in linear time and constant workspace vol. 57 of Leibniz International Proceedings in Informatics (2016), "24th Annual European Symposium on Algorithms, ESA 2016, August 22-24, 2016, Aarhus, Denmark", Schloss Dagstuhl – Leibniz-Zentrum für Informatik
201.
Adam Karczmarz, Jakub Łącki, Adam Polak, Jakub Radoszewski, Jakub Onufry Wojtaszczyk
200.
Counting Triangles in Large Graphs on GPU, 2016 IEEE INTERNATIONAL PARALLEL AND DISTRIBUTED PROCESSING SYMPOSIUM WORKSHOPS (IPDPSW) (2016), 740-746
199.
Bartłomiej Bosek, Jarosław Grytczuk, Paweł Rzążewski, Sebastian Czerwiński
198.
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
197.
196.
Kolja Knauer, Bartosz Walczak
Graph drawings with one bend and few slopes vol. 9644 of Lecture Notes in Computer Science (2016), "LATIN 2016: Theoretical Informatics, 12th Latin American Symposium, Ensenada, Mexico, April 11-15, 2016, Proceedings", Springer
192.
Bartłomiej Bosek, Dariusz Leniowski, Piotr Sankowski, Anna Zych
191.
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
190.
189.
Bartłomiej Bosek, Stefan Felsner, Kolja Knauer, Grzegorz Matecki

2015

186.
184.
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
183.
Marcin Kozik, Joanna Ochremiak
Algebraic Properties of Valued Constraint Satisfaction Problem, PROCEEDINGS OF 42ND INTERNATIONAL COLLOQUIUM, ICALP 2015 (2015), 846-858
182.
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
179.
Martin Balko, Vít Jelínek, Pavel Valtr, Bartosz Walczak
On the Beer index of convexity and its variants 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
177.
Libor Barto, Marcin Kozik, David Stanovský
176.
Marcin Kozik, Andrei Krokhin, Matthew Valeriote, Ross Willard
175.
Jarosław Grytczuk, Karol Kosiński, Michał Zmarz
How to Play Thue Games, THEOR COMPUT SCI vol. 582 (2015), 83-88
172.
Andrzej Grzesik, Mirjana Mikalački, Zoltán Lóránt Nagy, Alon Naor, Balázs Patkós, Fiona Skerman
Avoider-Enforcer star games, DISCRETE MATH THEOR vol. 17(1) (2015), 145-160
171.
Michał Dębski, Jarosław Grytczuk, Małgorzata Śleszyńska-Nowak
168.
Minors and dimension, (2015), "26th Annual ACM-SIAM Symposium on Discrete Algorithms, January 4-6, 2015, San Diego, California, USA", Society for Industrial and Applied Mathematics (SIAM)
165.
Roman Glebov, Andrzej Grzesik, Tereza Klimošová, Daniel Král

2014

163.
162.
Manuel Bodirsky, Hubie Chen, Michał Wrona
161.
Katarzyna Grygiel, Pierre Lescanne
Counting Terms in the Binary Lambda Calculus, DMTCS PROCEEDINGS - 25TH INTERNATIONAL CONFERENCE ON PROBABILISTIC, COMBINATORIAL AND ASYMPTOTIC METHODS FOR THE ANALYSIS OF ALGORITHMS vol. DMTCS-HAL Proceedings Series (2014), 13
159.
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
158.
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