Instytut Informatyki Analitycznej - lista publikacji

1-35 z 35.

2021

35.
Michał Wrona, Antoine Mottet, Tomáš Nagy, Michael Pinsker
Smooth Approximations and Relational Width Collapses, International Colloquium on Automata Languages and Programming [ICALP] vol. LIPIcs 198, Schloss Dagstuhl - Leibniz-Zentrum für Informatik 2021 (2021), 138:1-138:20
34.
Hoang La, Marthe Bonamy, Valentin Bartier, Laurine Bénéteau, Jonathan Narboni
33.
Hoang La, Mickael Montassier, Alexandre Pinlou, Petru Valicov
32.
Marcin Briański, Jan Gwinner, Vladyslav Hlembotskyi, Witold Jarnicki, Szymon Pliś, Adam Szady
30.
The Concentration of the Maximum Degree in the Duplication-Divergence Models, International Conference on Computing and Combinatorics [COCOON], (2021), 413-424
29.
Grzegorz Gutowski, Tomasz Krawczyk, Krzysztof Maziarz, Douglas West, Xuding Zhu, Michał Zając
28.
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
27.
Jana Novotná, Karolina Okrasa, Michał Pilipczuk, Paweł Rzążewski, Erik Jan van Leeuwen, Bartosz Walczak
26.
Vida Dujmović, Louis Esperet, Cyril Gavoille, Gwenaël Joret, Piotr Micek, Pat Morin
24.
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
23.
Michał Dębski, Stefan Felsner, Piotr Micek, Felix Schröder
Improved bounds for centered colorings, Advances in Combinatorics (2021), 28
22.
Gwenaël Joret, Piotr Micek, Bruce Reed, Michiel Smid
21.
Bartłomiej Bosek, Jarosław Grytczuk, Barbara Nayar, Bartosz Zaleski
20.
Bartłomiej Bosek, Andrzej Dudek, Michał Farnik, Jarosław Grytczuk, Przemysław Mazur
19.
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
18.
Jakub Chłędowski, Adam Polak, Bartosz Szabucki, Konrad Żołna
Robust Learning-Augmented Caching: An Experimental Study, International Conference on Machine Learning [ICML], (2021), 1920-1930
16.
Torsten Mütze, Jerri Nummenpalo, Bartosz Walczak
15.
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
14.
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
13.
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
7.
Robert Janczewski, Anna Maria Trzaskowska, Krzysztof Turowski
6.
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
5.
Parinya Chalermsook, Bartosz Walczak
Coloring and maximum weight independent set of rectangles, ACM/SIAM Symposium on Discrete Algorithms [SODA], (2021), 860-868
4.
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
2.
Csaba Biró, Bartłomiej Bosek, Heather C. Smith, William T. Trotter, Ruidong Wang, Stephen J. Young