Instytut Informatyki Analitycznej - lista publikacji
Nadjednostka:
Podjednostki:
1-20 z 20.
2024
20.
Oksana Firman, Grzegorz Gutowski, Myroslav Kryven, Yuto Okada, Alexander Wolff
Bounding the Treewidth of Outer k-Planar Graphs via Triangulations, Graph Drawing [GD] vol. 320 (2024), 14:1-14:17
19.
Paweł Kropiński, Bartłomiej Bosek, Mikołaj Pudo
18.
First-Fit Coloring of Forests in Random Arrival Model, International Symposium on Mathematical Foundations of Computer Science [MFCS] vol. 306 (2024), 33:1-33:10
17.
Marcin Anholcer, Bartłomiej Bosek, Jarosław Grytczuk
Majority choosability of countable graphs, European Journal of Combinatorics vol. 117 (2024), 103829
16.
Dynamic Prices in Ride-Sharing Scenarios, International Conference on Vehicle Technology and Intelligent Transport Systems [VEHITS], (2024), 437-443
15.
Lech Duraj, Krzysztof Potępa, Filip Konieczny
Better Diameter Algorithms for Bounded VC-Dimension Graphs and Geometric Intersection Graphs, European Symposium on Algorithms [ESA] vol. 308 (2024), 51:1-51:18
14.
Injective hardness condition for PCSPs, IEEE Symposium on Logic in Computer Science [LICS], (2024),
13.
Sándor Kisfaludi-Bak, Jana Masaříková, Erik Jan van Leeuwen, Bartosz Walczak, Karol Węgrzycki
Separator theorem and algorithms for planar hyperbolic graphs, International Symposium on Computational Geometry [SoCG] vol. 293 of Leibniz International Proceedings in Informatics (LIPIcs) (2024), 67:1-67:17
12.
Schnyder Woods and Alon-Tarsi Number of Planar Graphs, Electronic Journal of Combinatorics vol. Volume 31, Issue 1 (2024) (2024), 1-13
11.
Adam Polak, Maksym Zub
Learning-augmented maximum flow, Information Processing Letters vol. 186 (2024), 7
10.
Vida Dujmović, Robert Hickingbotham, Gwenaël Joret, Piotr Micek, Pat Morin, David R. Wood
The excluded tree minor theorem revisited, Combinatorics Probability and Computing vol. 33 (2024), 85-90
9.
Meike Hatzel, Gwenaël Joret, Piotr Micek, Marcin Pilipczuk, Torsten Ueckerdt, Bartosz Walczak
Tight bound on treedepth in terms of pathwidth and longest path, Combinatorica vol. 44 (2024), 417-427
8.
Vida Dujmović, Robert Hickingbotham, Jędrzej Hodor, Gwenaël Joret, Hoang La, Piotr Micek, Pat Morin, Clément Rambaud, David R. Wood
The grid-minor theorem revisited, ACM/SIAM Symposium on Discrete Algorithms [SODA], (2024), 1241-1245
7.
Joanna Chybowska-Sokół, Grzegorz Gutowski, Konstanty Junosza-Szaniawski, Patryk Mikos, Adam Polak
Online Coloring of Short Intervals, European Journal of Combinatorics vol. 118 (2024), 103919
6.
Coloring triangle-free L-graphs with O(log log n) colors, European Journal of Combinatorics vol. 117 (2024), 103831
5.
Gwenaël Joret, Piotr Micek, Michał Pilipczuk, Bartosz Walczak
Cliquewidth and dimension, ACM/SIAM Symposium on Discrete Algorithms [SODA], (2024), 1437-1446
4.
Jakub Kozik, Piotr Micek, William T. Trotter
Dimension is polynomial in height for posets with planar cover graphs, Journal of Combinatorial Theory. Series B vol. Volume 165, March 2024 (2024), 164-196
3.
Nick Fischer, Piotr Kaliciak, Adam Polak
Deterministic 3SUM-Hardness, Innovations in Theoretical Computer Science [ITCS], (2024),
2.
Marcin Briański, James Davies, Bartosz Walczak
Separating polynomial χ-boundedness from χ-boundedness, Combinatorica vol. 44 (2024), 1-8
1.
Zofia Kostrzycka, Marek Zaionc
Fuzzy Logics - quantitatively, Journal of Applied Non-Classical Logics vol. 34 (2024), 97-132