Partially-Commutative Context-Free Processes. - Wojciech Czerwinski; Sibylle B. Fröschle; Slawomir Lasota 001 (CONCUR, 2009)

Fast equivalence-checking for normed context-free processes. - Wojciech Czerwinski; Slawomir Lasota 001 (FSTTCS, 2010)

Partially-commutative context-free processes: Expressibility and tractability. - Wojciech Czerwinski; Sibylle B. Fröschle; Slawomir Lasota 001 (Inf. Comput., 2011)

Partially-commutative context-free languages - Wojciech Czerwinski; Slawomir Lasota 001 (EXPRESS/SOS, 2012)

Efficient Separability of Regular Languages by Subsequences and Suffixes. - Wojciech Czerwinski; Wim Martens; Tomás Masopust (ICALP (2), 2013)

Complexity of Checking Bisimilarity between Sequential and Parallel Processes. - Wojciech Czerwinski; Petr Jancar; Martin Kot; Zdenek Sawa (MFCS, 2013)

Reachability Problem for Weak Multi-Pushdown Automata. - Wojciech Czerwinski; Piotr Hofman; Slawomir Lasota 001 (Log. Methods Comput. Sci., 2013)

A Note on Decidable Separability by Piecewise Testable Languages. - Wojciech Czerwinski; Wim Martens (CoRR, 2014)

Decidability of Branching Bisimulation on Normed Commutative Context-Free Processes. - Wojciech Czerwinski; Piotr Hofman; Slawomir Lasota 001 (Theory Comput. Syst., 2014)

A Note on Decidable Separability by Piecewise Testable Languages. - Wojciech Czerwinski; Wim Martens; Lorijn van Rooijen; Marc Zeitoun (FCT, 2015)

Branching Bisimilarity of Normed BPA Processes Is in NEXPTIME. - Wojciech Czerwinski; Petr Jancar (LICS, 2015)

The (Almost) Complete Guide to Tree Pattern Containment. - Wojciech Czerwinski; Wim Martens; Pawel Parys; Marcin Przybylko (PODS, 2015)

Non-dominating Sequences of Vectors Using only Resets and Increments. - Wojciech Czerwinski; Tomasz Gogacz; Eryk Kopczynski (Fundam. Informaticae, 2015)

Minimization of Tree Pattern Queries. - Wojciech Czerwinski; Wim Martens; Matthias Niewerth; Pawel Parys (PODS, 2016)

Regular Separability of Parikh Automata. - Lorenzo Clemente; Wojciech Czerwinski; Slawomir Lasota 001; Charles Paperman (ICALP, 2017)

Separability of Reachability Sets of Vector Addition Systems. - Lorenzo Clemente; Wojciech Czerwinski; Slawomir Lasota 001; Charles Paperman (STACS, 2017)

Regular Separability of Well Structured Transition Systems. - Wojciech Czerwinski; Slawomir Lasota 001 (CoRR, 2017)

A Characterization for Decidable Separability by Piecewise Testable Languages. - Wojciech Czerwinski; Wim Martens; Lorijn van Rooijen; Marc Zeitoun; Georg Zetzsche (Discret. Math. Theor. Comput. Sci., 2017)

Deciding definability by deterministic regular expressions. - Wojciech Czerwinski; Claire David; Katja Losemann; Wim Martens (J. Comput. Syst. Sci., 2017)

Optimizing Tree Patterns for Querying Graph- and Tree-Structured Data. - Wojciech Czerwinski; Wim Martens; Matthias Niewerth; Pawel Parys (SIGMOD Rec., 2017)

Regular Separability of Well-Structured Transition Systems. - Wojciech Czerwinski; Slawomir Lasota 001; Roland Meyer 001; Sebastian Muskalla; K. Narayan Kumar; Prakash Saivasan (CONCUR, 2018)

Unboundedness Problems for Languages of Vector Addition Systems. - Wojciech Czerwinski; Piotr Hofman; Georg Zetzsche (ICALP, 2018)

The Reachability Problem for Petri Nets is Not Elementary (Extended Abstract). - Wojciech Czerwinski; Slawomir Lasota 001; Ranko Lazic 001; Jérôme Leroux; Filip Mazowiecki (CoRR, 2018)

Minimization of Tree Patterns. - Wojciech Czerwinski; Wim Martens; Matthias Niewerth; Pawel Parys (J. ACM, 2018)

Reasoning about integrity constraints for tree-structured data. - Wojciech Czerwinski; Claire David; Filip Murlak; Pawel Parys (Theory Comput. Syst., 2018)

New Pumping Technique for 2-Dimensional VASS. - Wojciech Czerwinski; Slawomir Lasota 001; Christof Löding; Radoslaw Piórkowski (MFCS, 2019)

Universal trees grow inside separating automata: Quasi-polynomial lower bounds for parity games. - Wojciech Czerwinski; Laure Daviaud; Nathanaël Fijalkow; Marcin Jurdzinski; Ranko Lazic 001; Pawel Parys (SODA, 2019)

Shortest paths in one-counter systems. - Dmitry Chistikov 001; Wojciech Czerwinski; Piotr Hofman; Michal Pilipczuk; Michael Wehar (Log. Methods Comput. Sci., 2019)

Regular Separability of One Counter Automata. - Wojciech Czerwinski; Slawomir Lasota 001 (Log. Methods Comput. Sci., 2019)

Reachability in Fixed Dimension Vector Addition Systems with States. - Wojciech Czerwinski; Slawomir Lasota 001; Ranko Lazic 001; Jérôme Leroux; Filip Mazowiecki (CONCUR, 2020)

Universality Problem for Unambiguous VASS. - Wojciech Czerwinski; Diego Figueira; Piotr Hofman (CONCUR, 2020)

An Approach to Regular Separability in Vector Addition Systems. - Wojciech Czerwinski; Georg Zetzsche (LICS, 2020)

On Dynamic Parameterized k-Path. - Jiehua Chen 001; Wojciech Czerwinski; Yann Disser; Andreas Emil Feldmann; Danny Hermelin; Wojciech Nadara; Michal Pilipczuk; Marcin Pilipczuk; Manuel Sorge; Bartlomiej Wróblewski 002; Anna Zych-Pawlewicz (CoRR, 2020)

Reachability in Vector Addition Systems is Ackermann-complete. - Wojciech Czerwinski; Lukasz Orlikowski (FOCS, 2021)

Improved Lower Bounds for Reachability in Vector Addition Systems. - Wojciech Czerwinski; Slawomir Lasota 001; Lukasz Orlikowski (ICALP, 2021)

New Techniques for Universality in Unambiguous Register Automata. - Wojciech Czerwinski; Antoine Mottet; Karin Quaas (ICALP, 2021)

Efficient fully dynamic elimination forests with applications to detecting long paths and cycles. - Jiehua Chen 001; Wojciech Czerwinski; Yann Disser; Andreas Emil Feldmann; Danny Hermelin; Wojciech Nadara; Marcin Pilipczuk; Michal Pilipczuk; Manuel Sorge; Bartlomiej Wróblewski 002; Anna Zych-Pawlewicz (SODA, 2021)

Long Runs Imply Big Separators in Vector Addition Systems. - Wojciech Czerwinski; Adam Jedrych (CoRR, 2021)

The Reachability Problem for Petri Nets Is Not Elementary. - Wojciech Czerwinski; Slawomir Lasota 001; Ranko Lazic 001; Jérôme Leroux; Filip Mazowiecki (J. ACM, 2021)

Improved Bounds for the Excluded-Minor Approximation of Treedepth. - Wojciech Czerwinski; Wojciech Nadara; Marcin Pilipczuk (SIAM J. Discret. Math., 2021)

Involved VASS Zoo (Invited Talk). - Wojciech Czerwinski (CONCUR, 2022)

The boundedness and zero isolation problems for weighted automata over nonnegative rationals. - Wojciech Czerwinski; Engel Lefaucheux; Filip Mazowiecki; David Purser; Markus A. Whiteland (LICS, 2022)

Lower Bounds for the Reachability Problem in Fixed Dimensional VASSes. - Wojciech Czerwinski; Lukasz Orlikowski (LICS, 2022)

Acyclic Petri and Workflow Nets with Resets. - Dmitry Chistikov 001; Wojciech Czerwinski; Piotr Hofman; Filip Mazowiecki; Henry Sinclair-Banks (FSTTCS, 2023)

New Lower Bounds for Reachability in Vector Addition Systems. - Wojciech Czerwinski; Ismaël Jecker; Slawomir Lasota 001; Jérôme Leroux; Lukasz Orlikowski (FSTTCS, 2023)

The Tractability Border of Reachability in Simple Vector Addition Systems with States. - Dmitry Chistikov 001; Wojciech Czerwinski; Filip Mazowiecki; Lukasz Orlikowski; Henry Sinclair-Banks; Karol Wegrzycki (FOCS, 2024)

Challenges of the Reachability Problem in Infinite-State Systems (Invited Paper). - Wojciech Czerwinski (MFCS, 2024)

Languages of Boundedly-Ambiguous Vector Addition Systems with States. - Wojciech Czerwinski; Lukasz Orlikowski (CONCUR, 2025)

Reachability in 3-VASS Is Elementary. - Wojciech Czerwinski; Ismaël Jecker; Slawomir Lasota 001; Lukasz Orlikowski (ICALP, 2025)

Reachability in One-Dimensional Pushdown Vector Addition Systems Is Decidable. - Clotilde Bizière; Wojciech Czerwinski (STOC, 2025)

Languages given by finite automata over the unary alphabet. - Wojciech Czerwinski; Maciej Debski; Tomasz Gogasz; Gordon Hoi; Sanjay Jain 001; Michal Skrzypczak; Frank Stephan 001; Christopher Tan (J. Comput. Syst. Sci., 2025)

Language Inclusion for Boundedly-Ambiguous Vector Addition Systems is Decidable. - Wojciech Czerwinski; Piotr Hofman (Log. Methods Comput. Sci., 2025)

Reachability and Related Problems in Vector Addition Systems with Nested Zero Tests. - Roland Guttenberg; Wojciech Czerwinski; Slawomir Lasota 001 (CoRR, 2025)