Powrót do listy instytutów
Publikacje
Czasopismo: Theory of Computing Systems
Liczba publikacji: 222024
- Michaël Cadilhac, Charles Paperman, Géraud Sénizergues, Filip Mazowiecki, Michał Pilipczuk , On Polynomial Recursive Sequences, Theory of Computing Systems, 68 2024, s. 593–614. Zobacz w PBN
2020
- Shaohua Li, Marcin Pilipczuk , An Improved FPT Algorithm for Independent Feedback Vertex Set, Theory of Computing Systems, 64 (8) 2020, s. 1317-1330. Zobacz w PBN
2019
- Piotr Sankowski , Karol Węgrzycki, Improved Distance Queries and Cycle Counting by Frobenius Normal Form, Theory of Computing Systems, 63 (5) 2019, s. 1049–1067. Zobacz w PBN
2018
- Wojciech Czerwiński , Claire David, Filip Murlak , Paweł Parys , Reasoning About Integrity Constraints for Tree-Structured Data, Theory of Computing Systems, 62 (4) 2018, s. 941–976. Zobacz w PBN
- Bartłomiej Bosek, Dariusz Leniowski, Anna Zych-Pawlewicz , Piotr Sankowski , Shortest augmenting paths for online matchings on trees, Theory of Computing Systems, 62 (2) 2018, s. 337-348. Zobacz w PBN
2017
- Jakub Lacki, Piotr Sankowski , Optimal Decremental Connectivity in Planar Graphs, Theory of Computing Systems, 2017. Zobacz w PBN
2016
- Anudhyan Boral, Marek Cygan , Tomasz Kociumaka, Marcin Pilipczuk , A Fast Branching Algorithm for Cluster Vertex Deletion, Theory of Computing Systems, 2016. Zobacz w PBN
- Marek Cygan , Lukasz Jez, Jiri Sgall, Online Knapsack Revisited, Theory of Computing Systems, 2016. Zobacz w PBN
- Marek Cygan , Marcin Pilipczuk , Michał Pilipczuk , Marcin Wrochna , Erik Jan van Leeuwen, Polynomial Kernelization for Removing Induced Claws and Diamonds, Theory of Computing Systems, 2016. Zobacz w PBN
2015
- Fedor V. Fomin, Petr A. Golovach, Jesper Nederlof, Michał Pilipczuk , Minimizing Rosenthal Potential in Multicast Games, Theory of Computing Systems, 2015. Zobacz w PBN
- Mikołaj Bojańczyk , Tomasz Idziaszek, Michał Skrzypczak , Regular languages of thin trees, Theory of Computing Systems, 2015. Zobacz w PBN
- Marek Cygan , Marcin Pilipczuk , Michał Pilipczuk , Jakub Onufry Wojtaszczyk, Sitting Closer to Friends than Enemies, Revisited, Theory of Computing Systems, 2015. Zobacz w PBN
2014
- Marcin Mucha , 13/9 -Approximation for Graphic TSP, Theory of Computing Systems, 2014. Zobacz w PBN
- Wojciech Czerwiński , Piotr Hofman , Sławomir Lasota , Decidability of branching bisimulation on normed commutative context-free processes, Theory of Computing Systems, 2014. Zobacz w PBN
- Marek Cygan , Marcin Pilipczuk , Michał Pilipczuk , Daniel Lokshtanov, Saket Saurabh, On the Hardness of Losing Width, Theory of Computing Systems, 54 (1) 2014, s. 73-82. Zobacz w PBN
2013
- Mikołaj Bojańczyk , Nominal Monoids, Theory of Computing Systems, 53 (2) 2013, s. 194-222. Zobacz w PBN
- André Arnold, Henryk Michalewski , Damian Niwiński , On the Separation Question for Tree Languages, Theory of Computing Systems, 2013. Zobacz w PBN
2012
- Michał Bielecki, Jan Van den Bussche, Jan Hidders, Jan Paredaens, Marc Spielmann, Jerzy Tyszkiewicz , The Navigational Power of Web Browsers, Theory of Computing Systems, 2012. Zobacz w PBN
2011
- Albert Atserias, Mikołaj Bojańczyk , Ronald Fagin, Floris Geerts, Kenneth Ross, Balder ten Cate, Foreword, Theory of Computing Systems, 2011. Zobacz w PBN
- Mikołaj Bojańczyk , Weak MSO with the Unbounding Quantifier, Theory of Computing Systems, 2011. Zobacz w PBN
2009
- Martin Grohe, Yuri Gurevich, Dirk Leinders, Nicole Schweikardt, Jerzy Tyszkiewicz , Jan Van den Bussche, Database Query Processing Using Finite Cursor Machines, Theory of Computing Systems, 2009. Zobacz w PBN
2008
- Piotr Sankowski , Processor Efficient Parallel Matching, Theory of Computing Systems, 2008. Zobacz w PBN