Instytut Informatyki Analitycznej - lista publikacji
Nadjednostka:
Podjednostki:
1-200 z 375.
2022
375.
Bartosz Walczak, James Davies, Chaya Keller, Linda Kleist, Shakhar Smorodinsky
A solution to Ringel's circle problem, International Symposium on Computational Geometry [SoCG] vol. 224 of Leibniz International Proceedings in Informatics (LIPIcs) (2022), 33:1-33:14
374.
Tytus Pikies, Wojciech Szpankowski, Krzysztof Turowski
373.
Robert Janczewski, Paweł Obszarski, Krzysztof Turowski
Weighted 2-sections and hypergraph reconstruction, Theoretical Computer Science vol. 915 (2022), 11-25
372.
Robert Janczewski, Paweł Obszarski, Krzysztof Turowski, Bartłomiej Wróblewski
Infinite chromatic games, Discrete Applied Mathematics vol. 309 (2022), 138-146
371.
370.
Satisfiability in multi-valued circuits , SIAM Journal on Computing vol. 51(3) (2022), 337-378
369.
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),
368.
Satisfiability problems for finite groups, International Colloquium on Automata Languages and Programming [ICALP](MAIN) vol. ICALP'22; 49th International Colloquium on Automata, Languages, and Programming, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2022), 127:1-127:20
367.
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
366.
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
365.
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
364.
Łukasz Bożyk, Jan Derbisz, Tomasz Krawczyk, Jana Novotná, Karolina Okrasa
363.
Vida Dujmović, Louis Esperet, Pat Morin, Bartosz Walczak, David R. Wood
Clustered 3-colouring graphs of bounded degree, Combinatorics Probability and Computing vol. 31 (2022), 123-135
362.
Marthe Bonamy, Nicolas Bousquet, Michał Pilipczuk, Paweł Rzążewski, Stéphan Thomassé, Bartosz Walczak
361.
Libor Barto, Marcin Kozik
Combinatorial Gap Theorem and Reductions between Promise CSPs, ACM/SIAM Symposium on Discrete Algorithms [SODA], (2022),
2021
360.
Alan Frieze, Wojciech Szpankowski, Krzysztof Turowski
The Concentration of the Maximum Degree in the Duplication-Divergence Models, International Conference on Computing and Combinatorics [COCOON], (2021), 413-424
359.
Tony Huynh, Gwenaël Joret, Piotr Micek, Michał Seweryn, Paul Wollan
Excludding a Ladder, Combinatorica (2021),
358.
The slow-coloring game on sparse graphs: k-degenerate, planar, and outerplanar, Journal of Combinatorics vol. 12 (2021) (2021), 283 – 302
357.
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
356.
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
355.
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
354.
Erdös-Hajnal Properties for Powers of Sparse Graphs, SIAM Journal on Discrete Mathematics vol. 35 (1) (2021), 447-464
353.
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
352.
Michał Dębski, Stefan Felsner, Piotr Micek, Felix Schröder
Improved bounds for centered colorings, Advances in Combinatorics (2021), 28
351.
Gwenaël Joret, Piotr Micek, Bruce Reed, Michiel Smid
Tight bounds on the clique chromatic number, Electronic Journal of Combinatorics vol. 28 (2021), Article number: P3.51, 8 pages
350.
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
349.
Hat chromatic number of graphs, Discrete Mathematics vol. 344(12) (2021), 112620
348.
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
347.
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
346.
Robust Learning-Augmented Caching: An Experimental Study, International Conference on Machine Learning [ICML], (2021), 1920-1930
345.
A note on the asymptotic expressiveness of ZF and ZFC, Journal of Logic and Computation vol. 31 (2021), 1598–1607
344.
Torsten Mütze, Jerri Nummenpalo, Bartosz Walczak
Sparse Kneser graphs are Hamiltonian, Journal of the London Mathematical Society vol. 103 (2021), 1253-1275
343.
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
342.
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
341.
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
340.
Efficient enumeration of non-isomorphic interval graphs, Discrete Mathematics and Theoretical Computer Science vol. vol. 23 no. 1 (2021),
339.
Katarzyna Grygiel, Isabella Larcher
338.
Jithin K. Sreedharan, Wojciech Szpankowski, Krzysztof Turowski
337.
336.
Jithin K. Sreedharan, Wojciech Szpankowski, Krzysztof Turowski
335.
Robert Janczewski, Anna Maria Trzaskowska, Krzysztof Turowski
T-colorings, divisibility and circular chromatic number, Discussiones Mathematicae Graph Theory vol. 41(2) (2021), 441-450
334.
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
333.
Parinya Chalermsook, Bartosz Walczak
Coloring and maximum weight independent set of rectangles, ACM/SIAM Symposium on Discrete Algorithms [SODA], (2021), 860-868
332.
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
331.
330.
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
329.
Solving CSPs using weak local consistency, SIAM Journal on Computing vol. 50(4) (2021), 1263-1286
2020
328.
Alan Frieze, Wojciech Szpankowski, Krzysztof Turowski
Degree Distribution for Duplication-Divergence Graphs: Large Deviations, International Workshop on Graph-Theoretic Concepts in Computer Science [WG], (2020), 226-237
327.
Jithin K. Sreedharan, Wojciech Szpankowski, Krzysztof Turowski
Temporal Ordered Clustering in Dynamic Networks, IEEE International Symposium on Information Theory [ISIT], (2020), 1349-1354
326.
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] vol. 16 (2020), 1-14
325.
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
324.
Ł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
323.
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
322.
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
321.
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
320.
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
319.
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)
318.
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
317.
Stefan Felsner, Tamás Mészáros, Piotr Micek
Boolean Dimension and Tree-Width, Combinatorica vol. 40 (2020), 655-677
316.
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)
315.
Tamás Mészáros, Piotr Micek, William T. Trotter
Boolean Dimension, Components and Blocks, Order (2020), 287-298
314.
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
313.
Abram Magner, Wojciech Szpankowski, Krzysztof Turowski
Compression of Dynamic Graphs Generated by a Duplication Model, Algorithmica vol. 82 (2020), 2687-2707
312.
Even faster algorithms for CSAT over supernilpotent algebras, International Symposium on Mathematical Foundations of Computer Science [MFCS] vol. 170 (2020), 55:1-55:13
311.
Faster general parsing through context-free memoization, ACM-SIGPLAN Conference on Programming Language Design and Implementation [PLDI], (2020), 1022-1035
310.
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
309.
Zofia Kostrzycka, Marek Zaionc
Quantitative Study of Fuzzy Logics, 2020 Ieee International Conference On Fuzzy Systems (fuzz-ieee) (2020), 1-8
308.
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)
307.
Online Coloring of Short Intervals, International Workshop On Approximation Algorithms for Combinatorial Optimization Problems (approx) vol. 176 (2020), 52:1–52:18
306.
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
305.
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
304.
303.
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
302.
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
301.
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
300.
Philippe Jacquet, Wojciech Szpankowski, Krzysztof Turowski
Asymptotics of Entropy of the Dirichlet-Multinomial Distribution, IEEE International Symposium on Information Theory [ISIT], (2019), 1517-1521
299.
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)
298.
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
297.
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
296.
Gwenaël Joret, Piotr Micek, Patrice Ossona de Mendez, Veit Wiechert
Nowhere dense graph classes and dimension, Combinatorica (2019), 1055-1079
295.
Robert Janczewski, Paweł Obszarski, Krzysztof Turowski
2-Coloring number revisited, Theoretical Computer Science vol. 796 (2019), 187-195
294.
Neininger Ralph, Hwang, Hsien-Kuei
Preface, Combinatorics Probability and Computing vol. 28(4) (2019), 483-484
293.
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
292.
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
291.
Alexandre Rok, Bartosz Walczak
Outerstring graphs are χ-bounded, SIAM Journal on Discrete Mathematics vol. 33 (2019), 2181-2199
290.
Coloring triangle-free L-graphs with O(log log n) colors, Acta Mathematica Universitatis Comenianae vol. 88 (2019), 1063-1069
289.
Marcin Anholcer, Bartłomiej Bosek, Jarosław Grytczuk
Majority coloring of infinite digraphs, Acta Mathematica Universitatis Comenianae vol. 88 (3) (2019), 371-376
288.
Maciej Bendkowski, Pierre Lescanne
On the enumeration of closures and environments with an application to random generation, Logical Methods in Computer Science vol. 15, Issue 4 (2019), 3:1–3:21
287.
Maciej Bendkowski, Olivier Bodini, Sergey Dovgal
Statistical Properties of Lambda Terms, Electronic Journal of Combinatorics vol. 26, Issue 4 (2019), 70
286.
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
285.
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
284.
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
283.
Lech Duraj, Marvin Künnemann, Adam Polak
282.
Alexandre Rok, Bartosz Walczak
Coloring curves that cross a fixed curve, Discrete and Computational Geometry vol. 61 (2019), 830-851
281.
280.
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
279.
David M. Howard, Noah Streib, William T. Trotter, Bartosz Walczak, Ruidong Wang
278.
Marcin Anholcer, Bartłomiej Bosek, Jarosław Grytczuk
Weight choosability of oriented hypergraphs, ARS Mathematica Contemporanea vol. 16 (1) (2019), 111-117
277.
Bartłomiej Bosek, Jarosław Grytczuk, Gabriel Jakóbczak
Majority coloring game, Discrete Applied Mathematics vol. 255 (2019), 15-20
2018
276.
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
275.
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
274.
Gwenaël Joret, Piotr Micek, Veit Wiechert
Sparsity and dimension, Combinatorica vol. 38 (2018), 1129-1148
273.
Abram Magner, Wojciech Szpankowski, Krzysztof Turowski
Lossless Compression of Binary Trees With Correlated Vertex Names, IEEE Transactions on Information Theory vol. 64 (9) (2018), 6070-6080
272.
271.
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
270.
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
269.
Mikkel Abrahamsen, Bartosz Walczak
268.
267.
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
266.
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
265.
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)
264.
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)
263.
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
262.
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
261.
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)
260.
Aleksander Byrski, Kevin Hammond, John Hughes, Wojciech Turek, Marek Zaionc
259.
Alexandr Kazda, Marcin Kozik, Ralph McKenzie, Matthew Moore
Absorption and directed Jónsson terms, (2018), "Don Pigozzi on Abstract Algebraic Logic", Springer
258.
Grzegorz Gutowski, Ming Han, Tomasz Krawczyk, Xuding Zhu
Defective 3-Paintability of Planar Graphs, Electronic Journal of Combinatorics vol. 25 (2) (2018), 20
257.
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
256.
An Easy Subexponential Bound for Online Chain Partitioning, Electronic Journal of Combinatorics vol. 25(2) (2018), #P2.28
255.
Deferred On-Line Bipartite Matching, Electronic Journal of Combinatorics vol. 25 (2) (2018), P2.24
254.
253.
252.
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
251.
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
250.
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)
249.
Karol Kosiński, Robert Mercas, Dirk Nowotka
248.
247.
On an Extremal Problem for Poset Dimension, Order vol. 35(3) (2018), 489-493
246.
245.
The Partial Visibility Representation Extension Problem, Algorithmica vol. 80 (8) (2018), 2286-2323
2017
244.
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
243.
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
242.
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
241.
Piotr Micek, Veit Wiechert
Topological minors of cover graphs and dimension, Journal of Graph Theory vol. 86.3 (2017), 295–314
240.
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
239.
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
238.
237.
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
236.
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
235.
Marcin Anholcer, Bartłomiej Bosek, Jarosław Grytczuk
Majority Choosability of Digraphs, Electronic Journal of Combinatorics vol. 24(3) (2017), #P3.57
234.
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
233.
Combinatorics of λ-terms: a natural approach, Journal of Logic and Computation vol. Volume 27, Issue 8 (2017), 2611–2630
232.
231.
Uniform Cross-entropy Clustering, Schedae Informaticae vol. 25 (2017), 117-126
230.
229.
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),
228.
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),
227.
Barnaby Martin, Andras Pongracz, Michał Wrona
The Complexity of Counting Quantifiers on Equality Languages, Theoretical Computer Science vol. 670 (2017), 56–67
226.
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
225.
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
224.
Piotr Micek, Veit Wiechert
An On-line Competitive Algorithm for Coloring Bipartite Graphs Without Long Induced Paths, Algorithmica vol. 77 (2017), 1060-1070
223.
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
222.
Maciej Bendkowski, Katarzyna Grygiel, Paul Tarau
Boltzmann Samplers for Closed Simply-Typed Lambda Terms, Lecture Notes in Computer Science vol. 10137 (2017), 120-135
221.
Martin Balko, Vít Jelínek, Pavel Valtr, Bartosz Walczak
On the Beer index of convexity and its variants, Discrete and Computational Geometry vol. 57 (2017), 179-214
220.
Minors and dimension, Journal of Combinatorial Theory. Series B vol. 122 (2017), 668-689
219.
On the likelihood of normalisation in combinatory logic, Journal of Logic and Computation vol. Volume 27, Issue 7 (2017), 2251–2269
2016
218.
Abram Magner, Wojciech Szpankowski, Krzysztof Turowski
Lossless compression of binary trees with correlated vertex names, IEEE International Symposium on Information Theory [ISIT], (2016), 1217-1221
217.
Robert Janczewski, Krzysztof Turowski
An O(n log n) algorithm for finding edge span of cacti, Journal of Combinatorial Optimization vol. 31(4) (2016), 1373-1382
216.
Robert Janczewski, Krzysztof Turowski
On the hardness of computing span of subcubic graphs, Information Processing Letters vol. 116(1) (2016), 26-32
215.
Criteria for regularity of Mahler power series and Becker's conjecture, Journal of Number Theory vol. 174 (2016), 456-486
214.
Vida Dujmović, Gwenaël Joret, Jakub Kozik, David R. Wood
Nonrepetitive colouring via entropy compression, Combinatorica vol. Volume 36, Issue 6 (2016), 661-686
213.
Piotr Danilewski, Philipp Slusallek
Building Code with Dynamic Staging, the Computing Research Repository (2016), 11
212.
Piotr Danilewski, Philipp Slusallek
ManyDSL: A Host for Many Languages, the Computing Research Repository (2016), 14
211.
Barnaby Martin, Andras Pongracz, Michał Wrona
The Complexity of Counting Quantifiers on Equality Languages, Lecture Notes in Computer Science vol. 9709 (2016), 333-342
210.
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)
209.
Steven Chaplick, Piotr Micek, Torsten Ueckerdt, Veit Wiechert
A note on concurrent graph sharing games, Integers vol. Volume 16, G1 (2016), 5
208.
Pathwidth and nonrepetitive list colorings, Electronic Journal of Combinatorics vol. Volume 23, Issue 4 (2016), 19
207.
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
206.
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
205.
Chip Games and Paintability, Electronic Journal of Combinatorics vol. 23 (3) (2016), 12
204.
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
203.
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
202.
Counting Triangles in Large Graphs on GPU, 2016 Ieee International Parallel and Distributed Processing Symposium Workshops (ipdpsw) (2016), 740-746
201.
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
200.
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
199.
Libor Barto, Marcin Kozik
Robustly Solvable Constraint Satisfaction Problems, SIAM Journal on Computing vol. 45(4) (2016), 1646–1669
198.
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
197.
Jakub Kozik, Dmitry A. Shabanov
Improved algorithms for colorings of simple hypergraphs and applications, Journal of Combinatorial Theory. Series B vol. Volume 116 (2016), 312-332
196.
Multipass greedy coloring of simple uniform hypergraphs, Random Structures and Algorithms vol. Volume 48, Issue 1 (2016), 125-146
195.
János Pach, Bartosz Walczak
194.
A natural counting of lambda terms, Lecture Notes in Computer Science vol. 9587 (2016), 183-194
193.
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
192.
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
191.
Jarosław Grytczuk, Karol Kosiński, Michał Zmarz
Nonrepetitive colorings of line arrangements, European Journal of Combinatorics vol. 51 (2016), 275-279
190.
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
189.
188.
Robert Janczewski, Krzysztof Turowski
187.
Robert Janczewski, Krzysztof Turowski
The Backbone Coloring Problem for Bipartite Backbones, Graphs and Combinatorics vol. 31(5) (2015), 1487-1496
186.
Robert Janczewski, Krzysztof Turowski
185.
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
184.
Marcin Kozik, Joanna Ochremiak
Algebraic Properties of Valued Constraint Satisfaction Problem, Proceedings of 42nd International Colloquium, Icalp 2015 (2015), 846-858
183.
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
182.
Katarzyna Grygiel, Pierre Lescanne
181.
Andrew Suk, Bartosz Walczak
180.
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
179.
Danila D. Cherkashin, Jakub Kozik
A note on random greedy coloring of uniform hypergraphs, Random Structures and Algorithms vol. 47 (2015), 407-413
178.
Libor Barto, Marcin Kozik, David Stanovský
Mal’tsev conditions, lack of absorption, and solvability, Algebra Universalis vol. 74 (2015), 185-206
177.
Marcin Kozik, Andrei Krokhin, Matthew Valeriote, Ross Willard
Characterizations of several Maltsev conditions, Algebra Universalis vol. 73 (2015), 205-224
176.
Jarosław Grytczuk, Karol Kosiński, Michał Zmarz
How to Play Thue Games, Theoretical Computer Science vol. 582 (2015), 83-88
Przejdź do strony: