You are not logged in | Log in

Journal: Leibniz International Proceedings in Informatics

Number of publications: 15

2022

Pavel Dvořák, Tomáš Masařík , Jana Masaříková , Paweł Rzążewski , Aneta Żuk, Monika Krawczyk, List Locally Surjective Homomorphisms in Hereditary Graph Classes, Leibniz International Proceedings in Informatics, 33rd International Symposium on Algorithms and Computation (ISAAC 2022), Seoul, the Republic of Korea, 18 December 2022 - 20 December 2022, 248 2022, p. 30:1-30:15. See in PBN
Kunal Dutta , Arijit Ghosh, Shay Moran, Uniform Brackets, Containers, and Combinatorial Macbeath Regions, Leibniz International Proceedings in Informatics, 13th Innovations in Theoretical Computer Science (2022), Berkeley, the United States of America, 31 January 2022 - 4 February 2022, 215 2022, p. 59:1-59:10. See in PBN

2020

Jakub Gajarský , Computing Srub-Depth Decompositions, Leibniz International Proceedings in Informatics, 37th Symposium on Theoretical Aspects of Computer Science, Montpellier, France, 10 March 2020 - 13 March 2020, 154 (56) 2020, p. 1-17. See in PBN
Udi Boker, Denis Kuperberg, Michał Skrzypczak , Karoliina Lehtinen, On the Succinctness of Alternating Parity Good-For-Games Automata, Leibniz International Proceedings in Informatics, 40th IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science, FSTTCS 2020, Goa, India, 14 December 2020 - 18 December 2020, 182 2020, p. 41:1--41:13. See in PBN
Marcin Wrochna , PACE solver description: Sallow: A heuristic algorithm for treedepth decompositions, Leibniz International Proceedings in Informatics, 15th International Symposium on Parameterized and Exact Computation (IPEC 2020), Hong Kong, China, 14 December 2020 - 18 December 2020. See in PBN
Alex Brandts, Marcin Wrochna , Stanislav Zivny, The complexity of promise SAT on non-boolean domains, Leibniz International Proceedings in Informatics, 47th International Colloquium on Automata, Languages, and Programming, Saarbrücken, Germany, 8 July 2020 - 11 July 2020. See in PBN
Karolina Okrasa, Łukasz Bożyk , Jan Derbisz, Tomasz Krawczyk, Jana Masaříková , Vertex deletion into bipartite permutation graphs, Leibniz International Proceedings in Informatics, 15th International Symposium on Parameterized and Exact Computation (IPEC 2020), Hong Kong, China, 14 December 2020 - 18 December 2020. See in PBN

2019

Wojciech Czerwiński , Sławomir Lasota , Löding, Christof, Radosław Piórkowski, New Pumping Technique for 2-Dimensional VASS, Leibniz International Proceedings in Informatics, 44th International Symposium on Mathematical Foundations of Computer Science, MFCS 2019, Aachen, Germany, 26 August 2019 - 30 August 2019, 138 2019, p. 62:1--62:14. See in PBN
Dušan Knop, Michał Pilipczuk , Marcin Wrochna , Tight complexity lower bounds for integer linear programming with few constraints, Leibniz International Proceedings in Informatics, 36th International Symposium on Theoretical Aspects of Computer Science, Berlin, Germany, 13 March 2019 - 16 March 2019, 126 2019, p. 44:1--44:15. See in PBN

2018

Paweł Rzążewski , Finding List Homomorphisms from Bounded-treewidth Graphs to Reflexive Graphs: a Complete Complexity Characterization, Leibniz International Proceedings in Informatics, 35th Symposium on Theoretical Aspects of Computer Science, STACS 2018, Caen, France, 28 February 2018 - 3 March 2018. See in PBN
Paweł Rzążewski , QPTAS and Subexponential Algorithm for Maximum Clique on Disk Graphs, Leibniz International Proceedings in Informatics, 34th International Symposium on Computational Geometry, Budapest, Hungary, 11 June 2018 - 14 June 2018. See in PBN

2017

Csaba Biró, Édouard Bonnet, Dániel Marx, Tillmann Miltzow, Paweł Rzążewski , Fine-Grained Complexity of Coloring Unit Disks and Balls, Leibniz International Proceedings in Informatics, 33rd International Symposium on Computational Geometry, Brisbane, Australia, 4 July 2017 - 7 July 2017. See in PBN
Jean-Daniel Boissonnat, Kunal Dutta , Arijit Ghosh, Sudeshna Kolay, Kernelization of the Subset General Position Problem in Geometry, Leibniz International Proceedings in Informatics, 83 2017, p. 25:1-25:13. See in PBN

2014

Marek Cygan , Tomasz Kociumaka, Constant Factor Approximation for Capacitated k-Center with Outliers, Leibniz International Proceedings in Informatics, 31st Symposium on Theoretical Aspects of Computer Science, Lyon, France, 5 March 2014 - 8 April 2014. See in PBN