Instytut Informatyki Analitycznej - lista publikacji

1-30 z 30.

2021

29.
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
28.
Jana Novotná, Karolina Okrasa, Michał Pilipczuk, Paweł Rzążewski, Erik Jan van Leeuwen, Bartosz Walczak
27.
Vida Dujmović, Louis Esperet, Cyril Gavoille, Gwenaël Joret, Piotr Micek, Pat Morin
25.
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
24.
Michał Dębski, Stefan Felsner, Piotr Micek, Felix Schröder
Improved bounds for centered colorings, ADVANCES IN COMBINATORICS (2021), 28
23.
Gwenaël Joret, Piotr Micek, Bruce Reed, Michiel Smid
22.
Bartłomiej Bosek, Jarosław Grytczuk, Barbara Nayar, Bartosz Zaleski
21.
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
20.
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
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.
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),
10.
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, EUR J COMBIN 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