| Publication | Date of Publication | Type |
|---|
| Deciding bisimulation and trace equivalences for systems with many identical processes | 2023-03-21 | Paper |
| Competitive analysis of on-line disk scheduling | 2023-01-25 | Paper |
On the decidability of the valuedness problem for two-way finite transducers
Information and Computation | 2022-06-08 | Paper |
| Contact representations of directed planar graphs in 2D and 3D | 2020-05-13 | Paper |
| Characterizing the valuedness of two-way finite transducers | 2019-10-15 | Paper |
Unfolding some classes of orthogonal polyhedra of arbitrary genus
Journal of Combinatorial Optimization | 2019-06-06 | Paper |
| On contact representations of directed planar graphs | 2018-10-04 | Paper |
| On bend-minimized orthogonal drawings of planar 3-graphs | 2018-08-13 | Paper |
Unfolding some classes of orthogonal polyhedra of arbitrary genus
Lecture Notes in Computer Science | 2017-10-23 | Paper |
Improved Algorithms for Grid-Unfolding Orthogonal Polyhedra
International Journal of Computational Geometry & Applications | 2017-10-20 | Paper |
On orthogonally convex drawings of plane graphs
Computational Geometry | 2017-06-29 | Paper |
Sequential versus concurrent languages of labeled conflict-free Petri nets
IEEE Transactions on Automatic Control | 2017-06-20 | Paper |
Petri nets and semilinear sets (extended abstract)
Theoretical Aspects of Computing – ICTAC 2016 | 2016-12-21 | Paper |
Area-universal drawings of biconnected outerplane graphs
Information Processing Letters | 2016-11-23 | Paper |
Unfolding orthogonal polyhedra with linear refinement
Algorithms and Computation | 2016-01-11 | Paper |
Constrained floorplans in 2D and 3D
Theoretical Computer Science | 2015-12-11 | Paper |
A new approach for contact graph representations and its applications
Lecture Notes in Computer Science | 2015-10-30 | Paper |
Rectilinear duals using monotone staircase polygons
Combinatorial Optimization and Applications | 2015-09-11 | Paper |
On orthogonally convex drawings of plane graphs (extended abstract)
Graph Drawing | 2013-12-20 | Paper |
On the containment and equivalence problems for two-way transducers
Theoretical Computer Science | 2012-05-30 | Paper |
On Almost-Sure Properties of Probabilistic Discrete Event Systems
Fundamenta Informaticae | 2011-11-22 | Paper |
One-and-a-half-side boundary labeling
Combinatorial Optimization and Applications | 2011-08-12 | Paper |
On two-way transducers
Developments in Language Theory | 2011-07-29 | Paper |
Petri nets with simple circuits
Lecture Notes in Computer Science | 2011-03-18 | Paper |
Complexity analysis of balloon drawing for rooted trees
Theoretical Computer Science | 2011-02-02 | Paper |
Timing parameter characterization of real-time systems
Implementation and Application of Automata | 2010-05-07 | Paper |
On decision problems for parameterized machines
Theoretical Computer Science | 2010-03-09 | Paper |
PATH DECOMPOSITION AND SEMILINEARITY OF PETRI NETS
International Journal of Foundations of Computer Science | 2009-08-21 | Paper |
Graph Drawing
Lecture Notes in Computer Science | 2009-08-11 | Paper |
On minimal elements of upward-closed sets
Theoretical Computer Science | 2009-06-04 | Paper |
Computing Minimal Elements of Upward-Closed Sets for Petri Nets
Petri Nets and Other Models of Concurrency – ICATPN 2007 | 2009-03-11 | Paper |
Concurrency, Synchronization, and Conflicts in Petri Nets
Implementation and Applications of Automata | 2009-02-12 | Paper |
Many-to-One Boundary Labeling
Journal of Graph Algorithms and Applications | 2009-01-19 | Paper |
On Balloon Drawings of Rooted Trees
Journal of Graph Algorithms and Applications | 2009-01-19 | Paper |
DECIDABILITY AND COMPLEXITY ANALYSIS OF FORBIDDEN STATE PROBLEMS FOR DISCRETE EVENT SYSTEMS
International Journal of Foundations of Computer Science | 2008-09-25 | Paper |
Width-Optimal Visibility Representations of Plane Graphs
Algorithms and Computation | 2008-05-27 | Paper |
Deterministic catalytic systems are not universal
Theoretical Computer Science | 2007-01-09 | Paper |
| On the computational power of 1-deterministic and sequential \(P\) systems | 2006-11-21 | Paper |
Implementation and Application of Automata
Lecture Notes in Computer Science | 2006-11-13 | Paper |
Membrane Computing
Lecture Notes in Computer Science | 2006-11-13 | Paper |
Graph Drawing
Lecture Notes in Computer Science | 2006-11-13 | Paper |
| Decidability analysis of self-stabilization for infinite-state systems | 2006-08-03 | Paper |
Computing and Combinatorics
Lecture Notes in Computer Science | 2006-01-11 | Paper |
Automata, Languages and Programming
Lecture Notes in Computer Science | 2006-01-10 | Paper |
Developments in Language Theory
Lecture Notes in Computer Science | 2005-12-22 | Paper |
ON VARIOUS NOTIONS OF PARALLELISM IN P SYSTEMS
International Journal of Foundations of Computer Science | 2005-08-03 | Paper |
Reachability solution characterization of parametric real-time systems
Theoretical Computer Science | 2005-01-11 | Paper |
| scientific article; zbMATH DE number 2084290 (Why is no real title available?) | 2004-08-06 | Paper |
| scientific article; zbMATH DE number 2080115 (Why is no real title available?) | 2004-08-04 | Paper |
Compact floor-planning via orderly spanning trees
Journal of Algorithms | 2004-03-14 | Paper |
| scientific article; zbMATH DE number 1974132 (Why is no real title available?) | 2003-09-03 | Paper |
| scientific article; zbMATH DE number 1836386 (Why is no real title available?) | 2002-11-27 | Paper |
| scientific article; zbMATH DE number 1832228 (Why is no real title available?) | 2002-11-19 | Paper |
A valuation-based analysis of conflict-free Petri nets
Systems & Control Letters | 2002-07-15 | Paper |
Distributed and on-line routing on tori
Algorithmica | 2002-05-21 | Paper |
| scientific article; zbMATH DE number 1497849 (Why is no real title available?) | 2001-03-05 | Paper |
Priority conflict-free Petri nets
Acta Informatica | 1999-03-29 | Paper |
Competitive analysis of on-line disk scheduling
Theory of Computing Systems | 1999-02-18 | Paper |
On reachability equivalence for BPP-nets
Theoretical Computer Science | 1998-07-22 | Paper |
Deciding a class of path formulas for conflict-free Petri nets
Theory of Computing Systems | 1997-08-24 | Paper |
Deciding bisimulation and trace equivalences for systems with many identical processes
Theoretical Computer Science | 1997-02-27 | Paper |
A note on fine covers and iterable factors of VAS languages
Information Processing Letters | 1997-02-27 | Paper |
On the regularity of Petri net languages
Information and Computation | 1996-07-03 | Paper |
SOME COMPLEXITY RESULTS FOR RINGS OF PETRI NETS
International Journal of Foundations of Computer Science | 1995-10-29 | Paper |
Complexity analysis of propositional concurrent programs using domino tiling
Mathematical Systems Theory | 1993-12-06 | Paper |
Normal and sinkless Petri nets
Journal of Computer and System Sciences | 1993-05-16 | Paper |
A multiparameter analysis of domino tiling with an application to concurrent systems
Theoretical Computer Science | 1992-09-27 | Paper |
A unified approach for deciding the existence of certain petri net paths
Information and Computation | 1992-06-28 | Paper |
| scientific article; zbMATH DE number 17543 (Why is no real title available?) | 1992-06-26 | Paper |
A taxonomy of fairness and temporal logic problems for Petri nets
Theoretical Computer Science | 1991-01-01 | Paper |
Priority systems with many identical processes
Acta Informatica | 1991-01-01 | Paper |
Global and local views of state fairness
Theoretical Computer Science | 1991-01-01 | Paper |
A polynomial time algorithm to decide pairwise concurrency of transitions for 1-bounded conflict-free Petri nets
Information Processing Letters | 1991-01-01 | Paper |
On optimal parallelization of sorting networks
Theoretical Computer Science | 1990-01-01 | Paper |
Communicating processes, scheduling, and the complexity of nontermination
Mathematical Systems Theory | 1990-01-01 | Paper |
Boundedness, hierarchy of fairness, and communication networks with delay
International Journal of Computer Mathematics | 1989-01-01 | Paper |
On the complexity of deciding fair termination of probabilistic concurrent finite-state programs
Theoretical Computer Science | 1988-01-01 | Paper |
| scientific article; zbMATH DE number 4070338 (Why is no real title available?) | 1988-01-01 | Paper |
| scientific article; zbMATH DE number 4031004 (Why is no real title available?) | 1987-01-01 | Paper |
An \(O(n^{1.5})\) algorithm to decide boundedness for conflict-free vector replacement systems
Information Processing Letters | 1987-01-01 | Paper |
Logspace Hierarchies, Polynomial Time and the Complexity of Fairness Problems Concerning $\omega $-Machines
SIAM Journal on Computing | 1987-01-01 | Paper |
| scientific article; zbMATH DE number 4035164 (Why is no real title available?) | 1987-01-01 | Paper |
A multiparameter analysis of the boundedness problem for vector addition systems
Journal of Computer and System Sciences | 1986-01-01 | Paper |
Some complexity bounds for problems concerning finite and 2-dimensional vector addition systems with states
Theoretical Computer Science | 1986-01-01 | Paper |
Boundedness, empty channel detection, and synchronization for communicating finite automata
Theoretical Computer Science | 1986-01-01 | Paper |
| scientific article; zbMATH DE number 3982496 (Why is no real title available?) | 1986-01-01 | Paper |
Logspace hierarchies, polynomial time and the complexity of fairness problems concerning ω-machines
STACS 86 | 1986-01-01 | Paper |
| scientific article; zbMATH DE number 3907779 (Why is no real title available?) | 1985-01-01 | Paper |
| scientific article; zbMATH DE number 3917705 (Why is no real title available?) | 1985-01-01 | Paper |
