Instytut Informatyki Analitycznej - lista publikacji
Nadjednostka:
Podjednostki:
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
356.
The slow-coloring game on sparse graphs: k-degenerate, planar, and outerplanar, JOURNAL OF COMBINATORICS vol. 12 (2021) (2021), 283 – 302
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
Subexponential-time algorithms for finding large induced sparse subgraphs, ALGORITHMICA vol. 83 (2021), 2634-2650
353.
Vida Dujmović, Louis Esperet, Cyril Gavoille, Gwenaël Joret, Piotr Micek, Pat Morin
Adjacency Labelling for Planar Graphs (and Beyond), J ACM vol. 68 (2021), 33
352.
Erdös-Hajnal Properties for Powers of Sparse Graphs, SIAM J DISCRETE MATH vol. 35 (1) (2021), 447-464
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
Tight bounds on the clique chromatic number, ELECTRON J COMB vol. 28 (2021), 8
348.
Bartłomiej Bosek, Jarosław Grytczuk, Barbara Nayar, Bartosz Zaleski
Nonrepetitive List Colorings of the Integers, ANN COMB vol. 25 (2) (2021), 393-403
347.
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
343.
342.
Torsten Mütze, Jerri Nummenpalo, Bartosz Walczak
Sparse Kneser graphs are Hamiltonian, J LOND MATH SOC vol. 103 (2021), 1253-1275
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),
338.
Efficient enumeration of non-isomorphic interval graphs, DISCRETE MATH THEOR vol. vol. 23 no. 1 (2021),
337.
Katarzyna Grygiel, Isabella Larcher
Unary profile of lambda terms with restricted De Bruijn indices, DISCRETE MATH THEOR vol. 22(3) (2021), 19
336.
Jithin K. Sreedharan, Wojciech Szpankowski, Krzysztof Turowski
Revisiting Parameter Estimation in Biological Networks: Influence of Symmetries, IEEE ACM T COMPUT BI vol. 18(3) (2021), 836-849
335.
Wojciech Szpankowski, Krzysztof Turowski
Towards Degree Distribution of a Duplication-Divergence Graph Model, ELECTRON J COMB vol. 28(1) (2021), P1.18
334.
Jithin K. Sreedharan, Wojciech Szpankowski, Krzysztof Turowski
333.
Robert Janczewski, Anna Maria Trzaskowska, Krzysztof Turowski
T-colorings, divisibility and circular chromatic number, DISCUSSIONES MATHEMATICAE GRAPH THEORY vol. 41(2) (2021), 441-450
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
329.
On-line partitioning of width w posets into w^O(log log w) chains, EUR J COMBIN vol. 91 (2021), 103202
328.
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
327.
Solving CSPs using weak local consistency, SIAM J COMPUT vol. 50(4) (2021), 1263-1286
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
Seymour's Conjecture on 2-Connected Graphs of Large Pathwidth, COMBINATORICA vol. 40 (2020), 839–868
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
Local dimension is unbounded for planar posets, ELECTRON J COMB vol. 27(4) (2020), P4.28
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
Planar Graphs Have Bounded Queue-Number, J ACM vol. 67(4) (2020), 22
316.
Stefan Felsner, Tamás Mészáros, Piotr Micek
Boolean Dimension and Tree-Width, COMBINATORICA vol. 40 (2020), 655-677
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
Boolean Dimension, Components and Blocks, ORDER (2020), 287-298
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
Compression of Dynamic Graphs Generated by a Duplication Model, ALGORITHMICA vol. 82 (2020), 2687-2707
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.
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
303.
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
A note on the minimum number of edges in hypergraphs with property O, EUR J COMBIN vol. 81 (2019), 172-177
296.
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, J COMB THEORY B vol. 138 (2019), 206-218
295.
Gwenaël Joret, Piotr Micek, Patrice Ossona de Mendez, Veit Wiechert
Nowhere dense graph classes and dimension, COMBINATORICA (2019), 1055-1079
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
Robust Algorithms with Polynomial Loss for Near-Unanimity CSPs, SIAM J COMPUT vol. 48(6) (2019), 1763–1795
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
Outerstring graphs are χ-bounded, SIAM J DISCRETE MATH vol. 33 (2019), 2181-2199
289.
Coloring triangle-free L-graphs with O(log log n) colors, AMUC vol. 88 (2019), 1063-1069
288.
Marcin Anholcer, Bartłomiej Bosek, Jarosław Grytczuk
Majority coloring of infinite digraphs, ACTA MATHEMATICA UNIVERSITATIS COMENIANAE vol. 88 (3) (2019), 371-376
287.
Maciej Bendkowski, Pierre Lescanne
On the enumeration of closures and environments with an application to random generation, LOG METH COMPUT SCI vol. 15, Issue 4 (2019), 3:1–3:21
286.
Maciej Bendkowski, Olivier Bodini, Sergey Dovgal
Statistical Properties of Lambda Terms, ELECTRON J COMB vol. 26, Issue 4 (2019), 70
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
282.
Lech Duraj, Marvin Künnemann, Adam Polak
281.
Alexandre Rok, Bartosz Walczak
Coloring curves that cross a fixed curve, DISCRETE COMPUT GEOM vol. 61 (2019), 830-851
280.
279.
Bartłomiej Bosek, Michał Farnik, Jarosław Grytczuk, Sebastian Czerwiński, Tomasz Bartnicki, Zofia Miechowicz
Generalized arboricity of graphs with large girth, DISCRETE MATH vol. 342(5) (2019), 1343-1350
278.
David M. Howard, Noah Streib, William T. Trotter, Bartosz Walczak, Ruidong Wang
277.
Marcin Anholcer, Bartłomiej Bosek, Jarosław Grytczuk
Weight choosability of oriented hypergraphs, ARS MATH CONTEMP vol. 16 (1) (2019), 111-117
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
Lossless Compression of Binary Trees With Correlated Vertex Names, IEEE T INFORM THEORY vol. 64 (9) (2018), 6070-6080
271.
270.
Stefan Felsner, Gwenaël Joret, Piotr Micek, William T. Trotter, Veit Wiechert
Burling Graphs, Chromatic Number, and Orthogonal Tree-Decompositions, ELECTRON J COMB vol. 25 (1) (2018), P1.35
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
268.
Mikkel Abrahamsen, Bartosz Walczak
Common tangents of two disjoint polygons in linear time and constant workspace, ACM T ALGORITHMS vol. 15 (2018), 12:1-21
267.
266.
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 APPL MATH vol. 251 (2018), 30-39
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)
259.
Aleksander Byrski, Kevin Hammond, John Hughes, Wojciech Turek, Marek Zaionc
258.
Alexandr Kazda, Marcin Kozik, Ralph McKenzie, Matthew Moore
Absorption and directed Jónsson terms, (2018), "Don Pigozzi on Abstract Algebraic Logic", Springer
257.
Grzegorz Gutowski, Ming Han, Tomasz Krawczyk, Xuding Zhu
Defective 3-Paintability of Planar Graphs, ELECTRON J COMB vol. 25 (2) (2018), 20
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
255.
An Easy Subexponential Bound for Online Chain Partitioning, ELECTRON J COMB vol. 25(2) (2018), #P2.28
254.
Deferred On-Line Bipartite Matching, ELECTRON J COMB vol. 25 (2) (2018), P2.24
253.
Every Plane Graph is Facially-Non-Repetitively C-choosable, ELECTRON J COMB vol. 25 (1) (2018), 13
252.
A new lower bound for the on-line coloring of intervals with bandwidth, THEOR COMPUT SCI vol. 708 (2018), 96-100
251.
Bartłomiej Bosek, Dariusz Leniowski, Piotr Sankowski, Anna Zych-Pawlewicz
Shortest Augmenting Paths for Online Matchings on Trees, THEOR COMPUT SYST vol. 62(2) (2018), 337-348
250.
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 MATH vol. 341(3) (2018), 781-785
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)
248.
Karol Kosiński, Robert Mercas, Dirk Nowotka
Corrigendum to "A note on Thue games" [Inf. Process. Lett. 118 (2017) 75-77], INFORM PROCESS LETT vol. 130 (2018), 63-65
247.
246.
On an Extremal Problem for Poset Dimension, ORDER vol. 35(3) (2018), 489-493
245.
Maciej Bendkowski, Katarzyna Grygiel, Paul Tarau
244.
The Partial Visibility Representation Extension Problem, ALGORITHMICA vol. 80 (8) (2018), 2286-2323
243.
A natural counting of lambda terms, LECTURE NOTES IN COMPUTER SCIENCE vol. 9587 (2018), 183-194
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
On the Dimension of Posets with Cover Graphs of Treewidth 2, ORDER vol. 34.2 (2017), 185-234
239.
Piotr Micek, Veit Wiechert
Topological minors of cover graphs and dimension, J GRAPH THEOR vol. 86.3 (2017), 295–314
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
Planar posets have dimension at most linear in their height, SIAM J DISCRETE MATH vol. 31 (4) (2017), 2754–2790
236.
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
Majority Choosability of Digraphs, ELECTRON J COMB vol. 24(3) (2017), #P3.57
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
230.
Universal targets for homomorphisms of edge-colored graphs, J COMB THEORY B vol. 127 (2017), 53-64
229.
Uniform Cross-entropy Clustering, SCHEDAE INFORMATICAE vol. 25 (2017), 117-126
228.
227.
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),
226.
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),
225.
Barnaby Martin, Andras Pongracz, Michał Wrona
The Complexity of Counting Quantifiers on Equality Languages, THEOR COMPUT SCI vol. 670 (2017), 56–67
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
222.
Piotr Micek, Veit Wiechert
An On-line Competitive Algorithm for Coloring Bipartite Graphs Without Long Induced Paths, ALGORITHMICA vol. 77 (2017), 1060-1070
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
220.
Maciej Bendkowski, Katarzyna Grygiel, Paul Tarau
Boltzmann Samplers for Closed Simply-Typed Lambda Terms, LECTURE NOTES IN COMPUTER SCIENCE vol. 10137 (2017), 120-135
219.
Martin Balko, Vít Jelínek, Pavel Valtr, Bartosz Walczak
On the Beer index of convexity and its variants, DISCRETE COMPUT GEOM vol. 57 (2017), 179-214
218.
Minors and dimension, J COMB THEORY B vol. 122 (2017), 668-689
217.
On the likelihood of normalisation in combinatory logic, J LOGIC COMPUT vol. Volume 27, Issue 7 (2017), 2251–2269
2016
216.
Lossless compression of binary trees with correlated vertex names, IEEE INTERNATIONAL SYMPOSIUM ON INFORMATION THEORY [ISIT], (2016), 1217-1221
215.
Robert Janczewski, Krzysztof Turowski
An O(n log n) algorithm for finding edge span of cacti, J COMB OPTIM vol. 31(4) (2016), 1373-1382
214.
Robert Janczewski, Krzysztof Turowski
On the hardness of computing span of subcubic graphs, INFORM PROCESS LETT vol. 116(1) (2016), 26-32
213.
Criteria for regularity of Mahler power series and Becker's conjecture, J NUMBER THEORY vol. 174 (2016), 456-486
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
209.
Barnaby Martin, Andras Pongracz, Michał Wrona
The Complexity of Counting Quantifiers on Equality Languages, LECTURE NOTES IN COMPUTER SCIENCE vol. 9709 (2016), 333--342
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.
Pathwidth and nonrepetitive list colorings, ELECTRON J COMB vol. Volume 23, Issue 4 (2016), 19
205.
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
The subpower membership problem for semigroups, INT J ALGEBR COMPUT vol. 26 (2016), 1435-1451
203.
Chip Games and Paintability, ELECTRON J COMB vol. 23 (3) (2016), 12
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
Distributed Tasks: Introducing Distributed Computing to Programming Competitions, OLYMPIADS IN INFORMATICS vol. 10 (2016), 177-194
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
Harmonious coloring of uniform hypergraphs, APPL ANAL DISCR MATH vol. 10(1) (2016), 73-87
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.
Libor Barto, Marcin Kozik
Robustly Solvable Constraint Satisfaction Problems, SIAM J COMPUT vol. 45(4) (2016), 1646–1669
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
195.
Jakub Kozik, Dmitry A. Shabanov
Improved algorithms for colorings of simple hypergraphs and applications, J COMB THEORY B vol. Volume 116 (2016), 312-332
194.
Multipass greedy coloring of simple uniform hypergraphs, RANDOM STRUCT ALGOR vol. Volume 48, Issue 1 (2016), 125-146
193.
János Pach, Bartosz Walczak
Decomposition of multiple packings with subquadratic union complexity, COMB PROBAB COMPUT vol. 25 (2016), 145-153
192.
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
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.
Jarosław Grytczuk, Karol Kosiński, Michał Zmarz
Nonrepetitive colorings of line arrangements, EUR J COMBIN vol. 51 (2016), 275-279
189.
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
188.
187.
Robert Janczewski, Krzysztof Turowski
186.
Robert Janczewski, Krzysztof Turowski
The Backbone Coloring Problem for Bipartite Backbones, GRAPH COMBINATOR vol. 31(5) (2015), 1487-1496
185.
Robert Janczewski, Krzysztof Turowski
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
181.
Katarzyna Grygiel, Pierre Lescanne
Counting and generating terms in the binary lambda calculus, J FUNCT PROGRAM vol. 25 (2015), 25
180.
Andrew Suk, Bartosz Walczak
New bounds on the maximum number of edges in k-quasi-planar graphs, COMP GEOM-THEOR APPL vol. 50 (2015), 24-33
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
178.
Danila D. Cherkashin, Jakub Kozik
A note on random greedy coloring of uniform hypergraphs, RANDOM STRUCT ALGOR vol. 47 (2015), 407-413
177.
Libor Barto, Marcin Kozik, David Stanovský
Mal’tsev conditions, lack of absorption, and solvability, ALGEBR UNIV vol. 74 (2015), 185-206
176.
Marcin Kozik, Andrei Krokhin, Matthew Valeriote, Ross Willard
Characterizations of several Maltsev conditions, ALGEBR UNIV vol. 73 (2015), 205-224
175.
Jarosław Grytczuk, Karol Kosiński, Michał Zmarz
How to Play Thue Games, THEOR COMPUT SCI vol. 582 (2015), 83-88
174.
A note on locality of algebras, J ALGEBRA vol. 433 (2015), 231-242
173.
Andrzej Grzesik, Michał Morayne, Małgorzata Sulkowska
From directed path to linear order - the best choice problem for powers of directed path, SIAM J DISCRETE MATH vol. 29(1) (2015), 500-513
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
The strong chromatic index of sparse graphs, INFORM PROCESS LETT vol. 115 (2015), 326–330
170.
Jarosław Grytczuk, Wojciech Lubawski
Splitting Multidimensional Necklaces and Measurable Colorings of Euclidean Spaces, SIAM J DISCRETE MATH vol. 29 (2015), 252–258
169.
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)
167.
166.
165.
Roman Glebov, Andrzej Grzesik, Tereza Klimošová, Daniel Král
Finitely forcible graphons and permutons, J COMB THEORY B vol. 110 (2015), 112-135
2014
164.
Tractability Frontier for Dually-Closed Ord-Horn Quantified Constraint Satisfaction Problems, LECTURE NOTES IN COMPUTER SCIENCE vol. 8634 (Springer) (2014), 535--546
163.
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
162.
Manuel Bodirsky, Hubie Chen, Michał Wrona
Tractability of quantified temporal constraints to the max, INT J ALGEBR COMPUT vol. 24 (2014), 1141--1156
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
160.
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
Przejdź do strony: