Publications

Journal: Theory Of Computing Systems

Number of publications: 18

2018

• Wojciech Czerwiński, Claire David, Filip Murlak and Paweł Parys, Reasoning About Integrity Constraints for Tree-Structured Data, Theory Of Computing Systems 62 (4) 2018, p. 941–976.see in PBN
• Piotr Sankowski and Karol Zbigniew Węgrzycki, Improved Distance Queries and Cycle Counting by Frobenius Normal Form, Theory Of Computing Systems 2018.see in PBN

2016

• Anudhyan Boral, Marek Adam Cygan, Tomasz Kociumaka and Marcin Pilipczuk, A Fast Branching Algorithm for Cluster Vertex Deletion, Theory Of Computing Systems 58 (2) 2016, p. 357–376.see in PBN
• Marek Adam Cygan, Marcin Pilipczuk, Michał Pilipczuk, Erik Jan van Leeuwen and Marcin Wrochna, Polynomial Kernelization for Removing Induced Claws and Diamonds, Theory Of Computing Systems 2016, p. 1–22.see in PBN
• Marek Adam Cygan, Lukasz Jez and Jiri Sgall, Online Knapsack Revisited, Theory Of Computing Systems 58 (1) 2016, p. 153–190.see in PBN

2015

• Marek Adam Cygan, Marcin Pilipczuk, Michał Pilipczuk and Jakub Onufry Wojtaszczyk, Sitting Closer to Friends than Enemies, Revisited, Theory Of Computing Systems 56 (2) 2015, p. 394–405.see in PBN
• Fedor V. Fomin, Petr A. Golovach, Jesper Nederlof and Michał Pilipczuk, Minimizing Rosenthal Potential in Multicast Games, Theory Of Computing Systems 57 (1) 2015, p. 81–96.see in PBN
• Tomasz Idziaszek, Michał Paweł Skrzypczak and Mikołaj Bojańczyk, Regular languages of thin trees, Theory Of Computing Systems 2015, p. 1–50.see in PBN

2014

• Marek Adam Cygan, Daniel Lokshtanov, Marcin Łukasz Pilipczuk, Michał Pilipczuk and Saket Saurabh, On the Hardness of Losing Width, Theory Of Computing Systems 54 (1) 2014, p. 73–82.see in PBN
• Marcin Ireneusz Mucha, 13/9 -Approximation for Graphic TSP, Theory Of Computing Systems 55 (4) 2014, p. 640–657.see in PBN
• Wojciech Czerwiński, Piotr Hofman and Sławomir Lasota, Decidability of branching bisimulation on normed commutative context-free processes, Theory Of Computing Systems 55 (1) 2014, p. 136–169.see in PBN

2013

• André Arnold, Henryk Michalewski and Damian Niwiński, On the Separation Question for Tree Languages, Theory Of Computing Systems 2013, p. 1–23.see in PBN
• Mikołaj Bojańczyk, Nominal Monoids, Theory Of Computing Systems 53 (2) 2013, p. 194–222.see in PBN

2012

• Michał Bielecki, Jan Hidders, Jan Paredaens, Marc Spielmann, Jerzy Tyszkiewicz and Jan Van den Bussche, The Navigational Power of Web Browsers, Theory Of Computing Systems 50 (2) 2012, p. 213–240.see in PBN

2011

• Albert Atserias, Mikołaj Bojańczyk, Balder ten Cate, Ronald Fagin, Floris Geerts and Kenneth Ross, Foreword, Theory Of Computing Systems 49 (2) 2011, p. 365–366.see in PBN
• Mikołaj Bojańczyk, Weak MSO with the Unbounding Quantifier, Theory Of Computing Systems 48 (3) 2011, p. 554–576.see in PBN

2009

• Martin Grohe, Yuri Gurevich, Dirk Leinders, Nicole Schweikardt, Jerzy Tyszkiewicz and Jan Van den Bussche, Database Query Processing Using Finite Cursor Machines, Theory Of Computing Systems 44 (4) 2009, p. 533–560.see in PBN

2008

• Piotr Sankowski, Processor Efficient Parallel Matching, Theory Of Computing Systems 42 (1) 2008, p. 73–90.see in PBN