Katedra Algorytmiki - lista publikacji

Nadjednostka:

[Wszystkie publikacje]


[2024] [2023] [2022] [2021] [2020] [2019] [2018] [2017] [2016] [2015] [2014] [2013] [2012] [2011] [2010] [2009] [2008] [2007] [2006] [2005] [2003] [1998] [1997] [1995] [1989] [1988] [1985]
1-19 z 19.

2021

19.
Marcin Briański, Jan Gwinner, Vladyslav Hlembotskyi, Witold Jarnicki, Szymon Pliś, Adam Szady
Introducing Structure to Expedite Quantum Search, Physical Review A (2021),
18.
Marcin Briański, Adam Szady
A short note on graphs with long Thomason's chains, Discrete Mathematics (2021),
17.
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
16.
Marcin Briański, Piotr Micek, Michał Pilipczuk, Michał Seweryn
Erdös-Hajnal Properties for Powers of Sparse Graphs, SIAM Journal on Discrete Mathematics vol. 35 (1) (2021), 447-464
15.
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
14.
Michał Dębski, Stefan Felsner, Piotr Micek, Felix Schröder
Improved bounds for centered colorings, Advances in Combinatorics (2021), 28
13.
Gwenaël Joret, Piotr Micek, Bruce Reed, Michiel Smid
Tight bounds on the clique chromatic number, Electronic Journal of Combinatorics vol. 28 (2021), P3.51
12.
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
11.
Bartłomiej Bosek, Andrzej Dudek, Michał Farnik, Jarosław Grytczuk, Przemysław Mazur
Hat chromatic number of graphs, Discrete Mathematics vol. 344(12) (2021), 112620
10.
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
9.
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
8.
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
7.
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
6.
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
5.
Patryk Mikos
Efficient enumeration of non-isomorphic interval graphs, Discrete Mathematics and Theoretical Computer Science vol. vol. 23 no. 1 (2021),
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
3.
Bartłomiej Bosek, Tomasz Krawczyk
On-line partitioning of width w posets into w^O(log log w) chains, European Journal of Combinatorics vol. 91 (2021), 103202
2.
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
1.
Marcin Kozik
Solving CSPs using weak local consistency, SIAM Journal on Computing vol. 50(4) (2021), 1263-1286