Wojciech Czerwinski
Publication record assembled from the DBLP archive of ranked conferences.
Papers indexed
40
Venues
13
Active years
2009–2026
Best venue rank
A*
Where they publish
Papers
40 indexed papers, newest first.
| Year | Venue | Title | Authors |
|---|---|---|---|
| 2026 | ICALP | Exploring VASS Parameterised by Geometric Dimension. | Wojciech Czerwinski, Roland Guttenberg, Lukasz Orlikowski, Henry Sinclair-Banks, Yangluo Zheng |
| 2026 | LICS | Reachability in VASS Extended with Integer Counters. | Clotilde Bizire, Wojciech Czerwinski, Roland Guttenberg, Jrme Leroux, Vincent Michielini, Lukasz Orlikowski, Antoni Puch, Henry Sinclair-Banks |
| 2025 | CONCUR | Languages of Boundedly-Ambiguous Vector Addition Systems with States. | Wojciech Czerwinski, Lukasz Orlikowski |
| 2025 | ICALP | Reachability in 3-VASS Is Elementary. | Wojciech Czerwinski, Ismal Jecker, Slawomir Lasota, Lukasz Orlikowski |
| 2025 | LICS | Reachability and Related Problems in Vector Addition Systems with Nested Zero Tests. | Roland Guttenberg, Wojciech Czerwinski, Slawomir Lasota |
| 2025 | STOC | Reachability in One-Dimensional Pushdown Vector Addition Systems Is Decidable. | Clotilde Bizire, Wojciech Czerwinski |
| 2024 | FOCS | The Tractability Border of Reachability in Simple Vector Addition Systems with States. | Dmitry Chistikov, Wojciech Czerwinski, Filip Mazowiecki, Lukasz Orlikowski, Henry Sinclair-Banks, Karol Wegrzycki |
| 2024 | MFCS | Challenges of the Reachability Problem in Infinite-State Systems (Invited Paper). | Wojciech Czerwinski |
| 2022 | CONCUR | Involved VASS Zoo (Invited Talk). | Wojciech Czerwinski |
| 2022 | CONCUR | Language Inclusion for Boundedly-Ambiguous Vector Addition Systems Is Decidable. | Wojciech Czerwinski, Piotr Hofman |
| 2022 | LICS | The boundedness and zero isolation problems for weighted automata over nonnegative rationals. | Wojciech Czerwinski, Engel Lefaucheux, Filip Mazowiecki, David Purser, Markus A. Whiteland |
| 2022 | LICS | Lower Bounds for the Reachability Problem in Fixed Dimensional VASSes. | Wojciech Czerwinski, Lukasz Orlikowski |
| 2021 | FOCS | Reachability in Vector Addition Systems is Ackermann-complete. | Wojciech Czerwinski, Lukasz Orlikowski |
| 2021 | ICALP | Improved Lower Bounds for Reachability in Vector Addition Systems. | Wojciech Czerwinski, Slawomir Lasota, Lukasz Orlikowski |
| 2021 | ICALP | New Techniques for Universality in Unambiguous Register Automata. | Wojciech Czerwinski, Antoine Mottet, Karin Quaas |
| 2021 | SODA | Efficient fully dynamic elimination forests with applications to detecting long paths and cycles. | Jiehua Chen, Wojciech Czerwinski, Yann Disser, Andreas Emil Feldmann, Danny Hermelin, Wojciech Nadara, Marcin Pilipczuk, Michal Pilipczuk, Manuel Sorge, Bartlomiej Wrblewski, Anna Zych-Pawlewicz |
| 2020 | CONCUR | Reachability in Fixed Dimension Vector Addition Systems with States. | Wojciech Czerwinski, Slawomir Lasota, Ranko Lazic, Jrme Leroux, Filip Mazowiecki |
| 2020 | CONCUR | Universality Problem for Unambiguous VASS. | Wojciech Czerwinski, Diego Figueira, Piotr Hofman |
| 2020 | LICS | An Approach to Regular Separability in Vector Addition Systems. | Wojciech Czerwinski, Georg Zetzsche |
| 2019 | ESA | Improved Bounds for the Excluded-Minor Approximation of Treedepth. | Wojciech Czerwinski, Wojciech Nadara, Marcin Pilipczuk |
| 2019 | MFCS | New Pumping Technique for 2-Dimensional VASS. | Wojciech Czerwinski, Slawomir Lasota, Christof Lding, Radoslaw Pirkowski |
| 2019 | SODA | Universal trees grow inside separating automata: Quasi-polynomial lower bounds for parity games. | Wojciech Czerwinski, Laure Daviaud, Nathanal Fijalkow, Marcin Jurdzinski, Ranko Lazic, Pawel Parys |
| 2019 | STOC | The reachability problem for Petri nets is not elementary. | Wojciech Czerwinski, Slawomir Lasota, Ranko Lazic, Jrme Leroux, Filip Mazowiecki |
| 2018 | CONCUR | Regular Separability of Well-Structured Transition Systems. | Wojciech Czerwinski, Slawomir Lasota, Roland Meyer, Sebastian Muskalla, K. Narayan Kumar, Prakash Saivasan |
| 2018 | ICALP | Unboundedness Problems for Languages of Vector Addition Systems. | Wojciech Czerwinski, Piotr Hofman, Georg Zetzsche |
| 2017 | ICALP | Regular Separability of Parikh Automata. | Lorenzo Clemente, Wojciech Czerwinski, Slawomir Lasota, Charles Paperman |
| 2017 | LICS | Regular separability of one counter automata. | Wojciech Czerwinski, Slawomir Lasota |
| 2017 | STACS | Separability of Reachability Sets of Vector Addition Systems. | Lorenzo Clemente, Wojciech Czerwinski, Slawomir Lasota, Charles Paperman |
| 2016 | FOSSACS | Shortest Paths in One-Counter Systems. | Dmitry Chistikov, Wojciech Czerwinski, Piotr Hofman, Michal Pilipczuk, Michael Wehar |
| 2016 | ICDT | Reasoning About Integrity Constraints for Tree-Structured Data. | Wojciech Czerwinski, Claire David, Filip Murlak, Pawel Parys |
| 2016 | PODS | Minimization of Tree Pattern Queries. | Wojciech Czerwinski, Wim Martens, Matthias Niewerth, Pawel Parys |
| 2015 | FCT | A Note on Decidable Separability by Piecewise Testable Languages. | Wojciech Czerwinski, Wim Martens, Lorijn van Rooijen, Marc Zeitoun |
| 2015 | LICS | Branching Bisimilarity of Normed BPA Processes Is in NEXPTIME. | Wojciech Czerwinski, Petr Jancar |
| 2015 | PODS | The (Almost) Complete Guide to Tree Pattern Containment. | Wojciech Czerwinski, Wim Martens, Pawel Parys, Marcin Przybylko |
| 2013 | FOSSACS | Deciding Definability by Deterministic Regular Expressions. | Wojciech Czerwinski, Claire David, Katja Losemann, Wim Martens |
| 2013 | ICALP | Efficient Separability of Regular Languages by Subsequences and Suffixes. | Wojciech Czerwinski, Wim Martens, Toms Masopust |
| 2013 | MFCS | Complexity of Checking Bisimilarity between Sequential and Parallel Processes. | Wojciech Czerwinski, Petr Jancar, Martin Kot, Zdenek Sawa |
| 2012 | CONCUR | Reachability Problem for Weak Multi-Pushdown Automata. | Wojciech Czerwinski, Piotr Hofman, Slawomir Lasota |
| 2011 | CONCUR | Decidability of Branching Bisimulation on Normed Commutative Context-Free Processes. | Wojciech Czerwinski, Piotr Hofman, Slawomir Lasota |
| 2009 | CONCUR | Partially-Commutative Context-Free Processes. | Wojciech Czerwinski, Sibylle Frschle, Slawomir Lasota |