Publikacje

Czasopismo: Leibniz International Proceedings in Informatics

2020

• 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 grudnia 2020 - 18 grudnia 2020, 182 2020, s. 41:1--41:13. Zobacz w 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 grudnia 2020 - 18 grudnia 2020. Zobacz w 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 lipca 2020 - 11 lipca 2020. Zobacz w 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 grudnia 2020 - 18 grudnia 2020. Zobacz w 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 sierpnia 2019 - 30 sierpnia 2019, 138 2019, s. 62:1--62:14. Zobacz w 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 marca 2019 - 16 marca 2019, 126 2019, s. 44:1--44:15. Zobacz w PBN

2017

• 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, s. 25:1-25:13. Zobacz w 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 marca 2014 - 8 kwietnia 2014. Zobacz w PBN

2013

• Ken-etsu Fujita, Aleksy Schubert , Decidable structures between Church-style and Curry-style, Leibniz International Proceedings in Informatics, Rewriting Techniques and Applications, 21 2013, s. 190-205. Zobacz w PBN