Publikacje

Czasopismo: Theory Of Computing Systems

Liczba publikacji: 18

2018

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

2016

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

2015

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

2014

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

2013

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

2012

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

2011

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

2009

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

2008

• Piotr Sankowski, Processor Efficient Parallel Matching, Theory Of Computing Systems 42 (1) 2008, s. 73–90.zobacz w PBN