Wojciech Czerwinski

92 papers A* 19A 3B 15Journal 49Unranked 6
YearRankTypeTitle / Venue / Authors
2026 J jnl
Exploring VASS Parameterised by Geometric Dimension.
CoRR
Wojciech Czerwinski, Roland Guttenberg, Lukasz Orlikowski, Henry Sinclair-Banks, Yangluo Zheng
2026 J jnl
Reachability in VASS Extended with Integer Counters.
CoRR
Clotilde Bizière, Wojciech Czerwinski, Roland Guttenberg, Jérôme Leroux, Vincent Michielini, Lukasz Orlikowski, Antoni Puch, Henry Sinclair-Banks
2025 J jnl
Language Equivalence is Undecidable in VASS with Restricted Nondeterminism.
CoRR
Wojciech Czerwinski, Lukasz Orlikowski
2025 J jnl
Language Inclusion for Boundedly-Ambiguous Vector Addition Systems is Decidable.
Log. Methods Comput. Sci.
Wojciech Czerwinski, Piotr Hofman
2025 J jnl
Languages given by finite automata over the unary alphabet.
J. Comput. Syst. Sci.
Wojciech Czerwinski, Maciej Debski, Tomasz Gogasz, Gordon Hoi, Sanjay Jain, Michal Skrzypczak, Frank Stephan, Christopher Tan
2025 B conf
Languages of Boundedly-Ambiguous Vector Addition Systems with States.
CONCUR
Wojciech Czerwinski, Lukasz Orlikowski
2025 J jnl
Languages of Boundedly-Ambiguous Vector Addition Systems with States.
CoRR
Wojciech Czerwinski, Lukasz Orlikowski
2025 A* conf
Reachability and Related Problems in Vector Addition Systems with Nested Zero Tests.
LICS
Roland Guttenberg, Wojciech Czerwinski, Slawomir Lasota
2025 J jnl
Reachability and Related Problems in Vector Addition Systems with Nested Zero Tests.
CoRR
Roland Guttenberg, Wojciech Czerwinski, Slawomir Lasota
2025 A* conf
Reachability in 3-VASS Is Elementary.
ICALP
Wojciech Czerwinski, Ismaël Jecker, Slawomir Lasota, Lukasz Orlikowski
2025 J jnl
Reachability in 3-VASS is Elementary.
CoRR
Wojciech Czerwinski, Ismaël Jecker, Slawomir Lasota, Lukasz Orlikowski
2025 A* conf
Reachability in One-Dimensional Pushdown Vector Addition Systems Is Decidable.
STOC
Clotilde Bizière, Wojciech Czerwinski
2024 B conf
Challenges of the Reachability Problem in Infinite-State Systems (Invited Paper).
MFCS
Wojciech Czerwinski
2024 J jnl
Reachability in One-Dimensional Pushdown Vector Addition Systems is Decidable.
CoRR
Clotilde Bizière, Wojciech Czerwinski
2024 A* conf
The Tractability Border of Reachability in Simple Vector Addition Systems with States.
FOCS
Dmitry Chistikov, Wojciech Czerwinski, Filip Mazowiecki, Lukasz Orlikowski, Henry Sinclair-Banks, Karol Wegrzycki
2024 J jnl
The Tractability Border of Reachability in Simple Vector Addition Systems with States.
CoRR
Dmitry Chistikov, Wojciech Czerwinski, Filip Mazowiecki, Lukasz Orlikowski, Henry Sinclair-Banks, Karol Wegrzycki
2023 — conf
Acyclic Petri and Workflow Nets with Resets.
FSTTCS
Dmitry Chistikov, Wojciech Czerwinski, Piotr Hofman, Filip Mazowiecki, Henry Sinclair-Banks
2023 J jnl
Acyclic Petri and Workflow Nets with Resets.
CoRR
Dmitry Chistikov, Wojciech Czerwinski, Piotr Hofman, Filip Mazowiecki, Henry Sinclair-Banks
2023 — conf
Languages Given by Finite Automata over the Unary Alphabet.
FSTTCS
Wojciech Czerwinski, Maciej Debski, Tomasz Gogasz, Gordon Hoi, Sanjay Jain, Michal Skrzypczak, Frank Stephan, Christopher Tan
2023 — conf
New Lower Bounds for Reachability in Vector Addition Systems.
FSTTCS
Wojciech Czerwinski, Ismaël Jecker, Slawomir Lasota, Jérôme Leroux, Lukasz Orlikowski
2023 J jnl
New Lower Bounds for Reachability in Vector Addition Systems.
CoRR
Wojciech Czerwinski, Ismaël Jecker, Slawomir Lasota, Jérôme Leroux, Lukasz Orlikowski
2022 B conf
Involved VASS Zoo (Invited Talk).
CONCUR
Wojciech Czerwinski
2022 B conf
Language Inclusion for Boundedly-Ambiguous Vector Addition Systems Is Decidable.
CONCUR
Wojciech Czerwinski, Piotr Hofman
2022 J jnl
Language Inclusion for Boundedly-Ambiguous Vector Addition Systems is Decidable.
CoRR
Wojciech Czerwinski, Piotr Hofman
2022 A* conf
Lower Bounds for the Reachability Problem in Fixed Dimensional VASSes.
LICS
Wojciech Czerwinski, Lukasz Orlikowski
2022 J jnl
Lower Bounds for the Reachability Problem in Fixed Dimensional VASSes.
CoRR
Wojciech Czerwinski, Lukasz Orlikowski
2022 A* conf
The boundedness and zero isolation problems for weighted automata over nonnegative rationals.
LICS
Wojciech Czerwinski, Engel Lefaucheux, Filip Mazowiecki, David Purser, Markus A. Whiteland
2022 J jnl
The boundedness and zero isolation problems for weighted automata over nonnegative rationals.
CoRR
Wojciech Czerwinski, Engel Lefaucheux, Filip Mazowiecki, David Purser, Markus A. Whiteland
2021 A* conf
Efficient fully dynamic elimination forests with applications to detecting long paths and cycles.
SODA
Jiehua Chen, Wojciech Czerwinski, Yann Disser, Andreas Emil Feldmann, Danny Hermelin, Wojciech Nadara, Marcin Pilipczuk, Michal Pilipczuk, Manuel Sorge, Bartlomiej Wróblewski, Anna Zych-Pawlewicz
2021 J jnl
Improved Bounds for the Excluded-Minor Approximation of Treedepth.
SIAM J. Discret. Math.
Wojciech Czerwinski, Wojciech Nadara, Marcin Pilipczuk
2021 A* conf
Improved Lower Bounds for Reachability in Vector Addition Systems.
ICALP
Wojciech Czerwinski, Slawomir Lasota, Lukasz Orlikowski
2021 J jnl
Long Runs Imply Big Separators in Vector Addition Systems.
CoRR
Wojciech Czerwinski, Adam Jedrych
2021 A* conf
New Techniques for Universality in Unambiguous Register Automata.
ICALP
Wojciech Czerwinski, Antoine Mottet, Karin Quaas
2021 J jnl
New Techniques for Universality in Unambiguous Register Automata.
CoRR
Wojciech Czerwinski, Antoine Mottet, Karin Quaas
2021 A* conf
Reachability in Vector Addition Systems is Ackermann-complete.
FOCS
Wojciech Czerwinski, Lukasz Orlikowski
2021 J jnl
Reachability in Vector Addition Systems is Ackermann-complete.
CoRR
Wojciech Czerwinski, Lukasz Orlikowski
2021 J jnl
The Reachability Problem for Petri Nets Is Not Elementary.
J. ACM
Wojciech Czerwinski, Slawomir Lasota, Ranko Lazic, Jérôme Leroux, Filip Mazowiecki
2020 A* conf
An Approach to Regular Separability in Vector Addition Systems.
LICS
Wojciech Czerwinski, Georg Zetzsche
2020 J jnl
An Approach to Regular Separability in Vector Addition Systems.
CoRR
Wojciech Czerwinski, Georg Zetzsche
2020 J jnl
On Dynamic Parameterized k-Path.
CoRR
Jiehua Chen, Wojciech Czerwinski, Yann Disser, Andreas Emil Feldmann, Danny Hermelin, Wojciech Nadara, Michal Pilipczuk, Marcin Pilipczuk, Manuel Sorge, Bartlomiej Wróblewski, Anna Zych-Pawlewicz
2020 B conf
Reachability in Fixed Dimension Vector Addition Systems with States.
CONCUR
Wojciech Czerwinski, Slawomir Lasota, Ranko Lazic, Jérôme Leroux, Filip Mazowiecki
2020 J jnl
Reachability in fixed dimension vector addition systems with states.
CoRR
Wojciech Czerwinski, Slawomir Lasota, Ranko Lazic, Jérôme Leroux, Filip Mazowiecki
2020 B conf
Universality Problem for Unambiguous VASS.
CONCUR
Wojciech Czerwinski, Diego Figueira, Piotr Hofman
2020 J jnl
Universality Problem for Unambiguous VASS.
CoRR
Wojciech Czerwinski, Diego Figueira, Piotr Hofman
2019 A conf
Improved Bounds for the Excluded-Minor Approximation of Treedepth.
ESA
Wojciech Czerwinski, Wojciech Nadara, Marcin Pilipczuk
2019 J jnl
Improved bounds for the excluded-minor approximation of treedepth.
CoRR
Wojciech Czerwinski, Wojciech Nadara, Marcin Pilipczuk
2019 B conf
New Pumping Technique for 2-Dimensional VASS.
MFCS
Wojciech Czerwinski, Slawomir Lasota, Christof Löding, Radoslaw Piórkowski
2019 J jnl
New Pumping Technique for 2-dimensional VASS.
CoRR
Wojciech Czerwinski, Slawomir Lasota, Christof Löding, Radoslaw Piórkowski
2019 J jnl
Regular Separability of One Counter Automata.
Log. Methods Comput. Sci.
Wojciech Czerwinski, Slawomir Lasota
2019 J jnl
Shortest paths in one-counter systems.
Log. Methods Comput. Sci.
Dmitry Chistikov, Wojciech Czerwinski, Piotr Hofman, Michal Pilipczuk, Michael Wehar
2019 A* conf
The reachability problem for Petri nets is not elementary.
STOC
Wojciech Czerwinski, Slawomir Lasota, Ranko Lazic, Jérôme Leroux, Filip Mazowiecki
2019 A* conf
Universal trees grow inside separating automata: Quasi-polynomial lower bounds for parity games.
SODA
Wojciech Czerwinski, Laure Daviaud, Nathanaël Fijalkow, Marcin Jurdzinski, Ranko Lazic, Pawel Parys
2018 J jnl
Minimization of Tree Patterns.
J. ACM
Wojciech Czerwinski, Wim Martens, Matthias Niewerth, Pawel Parys
2018 J jnl
Reasoning about integrity constraints for tree-structured data.
Theory Comput. Syst.
Wojciech Czerwinski, Claire David, Filip Murlak, Pawel Parys
2018 B conf
Regular Separability of Well-Structured Transition Systems.
CONCUR
Wojciech Czerwinski, Slawomir Lasota, Roland Meyer, Sebastian Muskalla, K. Narayan Kumar, Prakash Saivasan
2018 J jnl
The Reachability Problem for Petri Nets is Not Elementary (Extended Abstract).
CoRR
Wojciech Czerwinski, Slawomir Lasota, Ranko Lazic, Jérôme Leroux, Filip Mazowiecki
2018 A* conf
Unboundedness Problems for Languages of Vector Addition Systems.
ICALP
Wojciech Czerwinski, Piotr Hofman, Georg Zetzsche
2018 J jnl
Unboundedness problems for languages of vector addition systems.
CoRR
Wojciech Czerwinski, Piotr Hofman, Georg Zetzsche
2018 J jnl
Universal trees grow inside separating automata: Quasi-polynomial lower bounds for parity games.
CoRR
Wojciech Czerwinski, Laure Daviaud, Nathanaël Fijalkow, Marcin Jurdzinski, Ranko Lazic, Pawel Parys
2017 J jnl
A Characterization for Decidable Separability by Piecewise Testable Languages.
Discret. Math. Theor. Comput. Sci.
Wojciech Czerwinski, Wim Martens, Lorijn van Rooijen, Marc Zeitoun, Georg Zetzsche
2017 J jnl
Deciding definability by deterministic regular expressions.
J. Comput. Syst. Sci.
Wojciech Czerwinski, Claire David, Katja Losemann, Wim Martens
2017 J jnl
Optimizing Tree Patterns for Querying Graph- and Tree-Structured Data.
SIGMOD Rec.
Wojciech Czerwinski, Wim Martens, Matthias Niewerth, Pawel Parys
2017 J jnl
Regular Separability of One Counter Automata.
CoRR
Wojciech Czerwinski, Slawomir Lasota
2017 A* conf
Regular Separability of Parikh Automata.
ICALP
Lorenzo Clemente, Wojciech Czerwinski, Slawomir Lasota, Charles Paperman
2017 J jnl
Regular Separability of Well Structured Transition Systems.
CoRR
Wojciech Czerwinski, Slawomir Lasota
2017 A* conf
Regular separability of one counter automata.
LICS
Wojciech Czerwinski, Slawomir Lasota
2017 A conf
Separability of Reachability Sets of Vector Addition Systems.
STACS
Lorenzo Clemente, Wojciech Czerwinski, Slawomir Lasota, Charles Paperman
2016 A* conf
Minimization of Tree Pattern Queries.
PODS
Wojciech Czerwinski, Wim Martens, Matthias Niewerth, Pawel Parys
2016 A conf
Reasoning About Integrity Constraints for Tree-Structured Data.
ICDT
Wojciech Czerwinski, Claire David, Filip Murlak, Pawel Parys
2016 J jnl
Regular Separability of Parikh Automata.
CoRR
Lorenzo Clemente, Wojciech Czerwinski, Slawomir Lasota, Charles Paperman
2016 J jnl
Separability of Reachability Sets of Vector Addition Systems.
CoRR
Lorenzo Clemente, Wojciech Czerwinski, Slawomir Lasota, Charles Paperman
2016 B conf
Shortest Paths in One-Counter Systems.
FoSSaCS
Dmitry Chistikov, Wojciech Czerwinski, Piotr Hofman, Michal Pilipczuk, Michael Wehar
2015 B conf
A Note on Decidable Separability by Piecewise Testable Languages.
FCT
Wojciech Czerwinski, Wim Martens, Lorijn van Rooijen, Marc Zeitoun
2015 A* conf
Branching Bisimilarity of Normed BPA Processes Is in NEXPTIME.
LICS
Wojciech Czerwinski, Petr Jancar
2015 J jnl
Non-dominating Sequences of Vectors Using only Resets and Increments.
Fundam. Informaticae
Wojciech Czerwinski, Tomasz Gogacz, Eryk Kopczynski
2015 J jnl
Non-dominating sequences of vectors using only resets and increments.
CoRR
Wojciech Czerwinski, Tomasz Gogacz, Eryk Kopczynski
2015 J jnl
Shortest paths in one-counter systems.
CoRR
Dmitry Chistikov, Wojciech Czerwinski, Piotr Hofman, Michal Pilipczuk, Michael Wehar
2015 A* conf
The (Almost) Complete Guide to Tree Pattern Containment.
PODS
Wojciech Czerwinski, Wim Martens, Pawel Parys, Marcin Przybylko
2014 J jnl
A Note on Decidable Separability by Piecewise Testable Languages.
CoRR
Wojciech Czerwinski, Wim Martens
2014 J jnl
Branching Bisimilarity of Normed BPA Processes is in NEXPTIME.
CoRR
Wojciech Czerwinski, Petr Jancar
2014 J jnl
Decidability of Branching Bisimulation on Normed Commutative Context-Free Processes.
Theory Comput. Syst.
Wojciech Czerwinski, Piotr Hofman, Slawomir Lasota
2013 B conf
Complexity of Checking Bisimilarity between Sequential and Parallel Processes.
MFCS
Wojciech Czerwinski, Petr Jancar, Martin Kot, Zdenek Sawa
2013 B conf
Deciding Definability by Deterministic Regular Expressions.
FoSSaCS
Wojciech Czerwinski, Claire David, Katja Losemann, Wim Martens
2013 J jnl
Efficient Separability of Regular Languages by Subsequences and Suffixes
CoRR
Wojciech Czerwinski, Wim Martens, Tomás Masopust
2013 — conf
Efficient Separability of Regular Languages by Subsequences and Suffixes.
ICALP (2)
Wojciech Czerwinski, Wim Martens, Tomás Masopust
2013 J jnl
Reachability Problem for Weak Multi-Pushdown Automata.
Log. Methods Comput. Sci.
Wojciech Czerwinski, Piotr Hofman, Slawomir Lasota
2012 — conf
Partially-commutative context-free languages
EXPRESS/SOS
Wojciech Czerwinski, Slawomir Lasota
2012 B conf
Reachability Problem for Weak Multi-Pushdown Automata.
CONCUR
Wojciech Czerwinski, Piotr Hofman, Slawomir Lasota
2011 B conf
Decidability of Branching Bisimulation on Normed Commutative Context-Free Processes.
CONCUR
Wojciech Czerwinski, Piotr Hofman, Slawomir Lasota
2011 J jnl
Partially-commutative context-free processes: Expressibility and tractability.
Inf. Comput.
Wojciech Czerwinski, Sibylle B. Fröschle, Slawomir Lasota
2010 — conf
Fast equivalence-checking for normed context-free processes.
FSTTCS
Wojciech Czerwinski, Slawomir Lasota
2009 B conf
Partially-Commutative Context-Free Processes.
CONCUR
Wojciech Czerwinski, Sibylle B. Fröschle, Slawomir Lasota