Instytut Informatyki Analitycznej - lista publikacji
Nadjednostka:
Podjednostki:
1-25 z 25.
2019
25.
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
24.
Philippe Jacquet, Wojciech Szpankowski, Krzysztof Turowski
Asymptotics of Entropy of the Dirichlet-Multinomial Distribution, IEEE International Symposium on Information Theory [ISIT], (2019), 1517-1521
23.
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)
22.
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
21.
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
20.
Gwenaël Joret, Piotr Micek, Patrice Ossona de Mendez, Veit Wiechert
Nowhere dense graph classes and dimension, Combinatorica (2019), 1055-1079
19.
Robert Janczewski, Paweł Obszarski, Krzysztof Turowski
2-Coloring number revisited, Theoretical Computer Science vol. 796 (2019), 187-195
18.
Marek Zaionc, Neininger Ralph, Hwang
Preface, Combinatorics Probability and Computing vol. 28(4) (2019), 483-484
17.
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
16.
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
15.
Alexandre Rok, Bartosz Walczak
Outerstring graphs are χ-bounded, SIAM Journal on Discrete Mathematics vol. 33 (2019), 2181-2199
14.
Coloring triangle-free L-graphs with O(log log n) colors, Acta Mathematica Universitatis Comenianae vol. 88 (2019), 1063-1069
13.
Marcin Anholcer, Bartłomiej Bosek, Jarosław Grytczuk
Majority coloring of infinite digraphs, Acta Mathematica Universitatis Comenianae vol. 88 (3) (2019), 371-376
12.
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
11.
Maciej Bendkowski, Olivier Bodini, Sergey Dovgal
Statistical Properties of Lambda Terms, Electronic Journal of Combinatorics vol. 26, Issue 4 (2019), 70
10.
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
9.
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
8.
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
7.
Lech Duraj, Marvin Künnemann, Adam Polak
6.
Alexandre Rok, Bartosz Walczak
Coloring curves that cross a fixed curve, Discrete and Computational Geometry vol. 61 (2019), 830-851
5.
4.
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
3.
David M. Howard, Noah Streib, William T. Trotter, Bartosz Walczak, Ruidong Wang
2.
Marcin Anholcer, Bartłomiej Bosek, Jarosław Grytczuk
Weight choosability of oriented hypergraphs, ARS Mathematica Contemporanea vol. 16 (1) (2019), 111-117
1.
Bartłomiej Bosek, Jarosław Grytczuk, Gabriel Jakóbczak
Majority coloring game, Discrete Applied Mathematics vol. 255 (2019), 15-20