Instytut Informatyki Analitycznej - lista publikacji

Nadjednostka:

Wydział Matematyki i Informatyki UJ

Podjednostki:

[2024] [2023] [2022] [2021] [2020] [2019] [2018] [2017] [2016] [2015] [2014] [2013] [2012] [2011] [2010] [2009] [2008] [2007] [2006] [2005] [2004] [2003] [2001] [2000] [1998] [1997] [1995] [1992] [1990] [1989] [1988] [1987] [1985] [1984]

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

A note on deterministic zombies, Discrete Applied Mathematics (2021),

33.

Hoang La, Mickael Montassier, Alexandre Pinlou, Petru Valicov

r-hued (r + 1)-coloring of planar graphs with girth at least 8 for r ≥ 9, European Journal of Combinatorics (2021),

32.

Marcin Briański, Jan Gwinner, Vladyslav Hlembotskyi, Witold Jarnicki, Szymon Pliś, Adam Szady

Introducing Structure to Expedite Quantum Search, Physical Review A (2021),

31.

Marcin Briański, Adam Szady

A short note on graphs with long Thomason's chains, Discrete Mathematics (2021),

30.

Alan Frieze, Wojciech Szpankowski, Krzysztof Turowski

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

The Slow-Coloring Game on Sparse Graphs: k-Degenerate, Planar, and Outerplanar, Journal of Combinatorics vol. 12 (2021) (2021), 283 – 302

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

Subexponential-time algorithms for finding large induced sparse subgraphs, Algorithmica vol. 83 (2021), 2634-2650

26.

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

25.

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

24.

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

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

Tight bounds on the clique chromatic number, Electronic Journal of Combinatorics vol. 28 (2021), P3.51

21.

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

20.

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

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

17.

Maciej Bendkowski

A note on the asymptotic expressiveness of ZF and ZFC, Journal of Logic and Computation vol. 31 (2021), 1598–1607

16.

Torsten Mütze, Jerri Nummenpalo, Bartosz Walczak

Sparse Kneser graphs are Hamiltonian, Journal of the London Mathematical Society vol. 103 (2021), 1253-1275

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.

Jakub Kozik

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

12.

Patryk Mikos

Efficient enumeration of non-isomorphic interval graphs, Discrete Mathematics and Theoretical Computer Science vol. vol. 23 no. 1 (2021),

11.

Katarzyna Grygiel, Isabella Larcher

Unary profile of lambda terms with restricted De Bruijn indices, Discrete Mathematics and Theoretical Computer Science vol. 22(3) (2021), 19

10.

Jithin K. Sreedharan, Wojciech Szpankowski, Krzysztof Turowski

Revisiting Parameter Estimation in Biological Networks: Influence of Symmetries, IEEE-ACM Transactions on Computational Biology and Bioinformatics vol. 18(3) (2021), 836-849

Wojciech Szpankowski, Krzysztof Turowski

Towards Degree Distribution of a Duplication-Divergence Graph Model, Electronic Journal of Combinatorics vol. 28(1) (2021), P1.18

Jithin K. Sreedharan, Wojciech Szpankowski, Krzysztof Turowski