| Publication | Date of Publication | Type |
|---|
Bounded tree-width and LOGCFL
Graph-Theoretic Concepts in Computer Science | 2024-01-05 | Paper |
Exponential time analysis of confluent and boundary eNCE graph languages
Graph-Theoretic Concepts in Computer Science | 2024-01-05 | Paper |
A note on the complexity of \(k\)\textsc{-metric dimension}
Applied Mathematics and Computation | 2023-09-11 | Paper |
An approximation algorithm for stacking up bins from a conveyer onto pallets
Lecture Notes in Computer Science | 2022-08-19 | Paper |
Computing directed Steiner path covers
Journal of Combinatorial Optimization | 2022-04-13 | Paper |
| Competitive analysis of on-line stack-up algorithms | 2021-12-20 | Paper |
| Exact solutions for the Steiner path cover problem on special graph classes | 2021-08-30 | Paper |
Computing directed Steiner path covers for directed co-graphs (extended abstract)
SOFSEM 2020: Theory and Practice of Computer Science | 2020-07-20 | Paper |
The fault-tolerant metric dimension of cographs
(available as arXiv preprint) | 2020-01-30 | Paper |
Controlling distribution conveyors and multiline palletizers: theoretical foundations and online algorithms
OR Spectrum | 2020-01-15 | Paper |
Computing the Metric Dimension by Decomposing Graphs into Extended Biconnected Components
WALCOM: Algorithms and Computation | 2019-10-15 | Paper |
Polynomial time analysis of toroidal periodic graphs
Automata, Languages and Programming | 2019-04-29 | Paper |
The Fault-Tolerant Metric Dimension of Cographs
(available as arXiv preprint) | 2019-04-07 | Paper |
The bounded degree problem for non-obstructing eNCE graph grammars
Lecture Notes in Computer Science | 2019-01-10 | Paper |
Computing the metric dimension by decomposing graphs into extended biconnected components
(available as arXiv preprint) | 2018-06-27 | Paper |
Minimizing the number of max-power users in ad-hoc wireless networks with minimum node degree requirements
Information Processing Letters | 2018-05-25 | Paper |
An Experimental Study of Algorithms for Controlling Palletizers
Operations Research Proceedings | 2017-12-01 | Paper |
On-line algorithms for controlling palletizers
Operations Research Proceedings 2016 | 2017-12-01 | Paper |
A practical approach for the FIFO stack-up problem
Advances in Intelligent Systems and Computing | 2017-09-12 | Paper |
Algorithms for controlling palletizers
Operations Research Proceedings | 2016-05-19 | Paper |
A linear time algorithm for metric dimension of cactus block graphs
Theoretical Computer Science | 2016-05-02 | Paper |
On the complexity of the FIFO stack-up problem
Mathematical Methods of Operations Research | 2016-03-24 | Paper |
Directed pathwidth and palletizers
Combinatorial Optimization and Applications | 2016-02-05 | Paper |
Directed NLC-width
Theoretical Computer Science | 2016-01-21 | Paper |
Exact algorithms for difficult graph problems
eXamen.press | 2010-07-19 | Paper |
On Module-Composed Graphs
Graph-Theoretic Concepts in Computer Science | 2010-01-21 | Paper |
The NLC-width and clique-width for powers of graphs of bounded tree-width
Discrete Applied Mathematics | 2009-06-30 | Paper |
LATIN 2004: Theoretical Informatics
Lecture Notes in Computer Science | 2009-05-07 | Paper |
The Clique-Width of Tree-Power and Leaf-Power Graphs
Graph-Theoretic Concepts in Computer Science | 2008-07-01 | Paper |
Line graphs of bounded clique-width
Discrete Mathematics | 2007-11-27 | Paper |
A local characterization of bounded clique-width for line graphs
Discrete Mathematics | 2007-03-02 | Paper |
Graph-Theoretic Concepts in Computer Science
Lecture Notes in Computer Science | 2006-11-01 | Paper |
Vertex disjoint paths on clique-width bounded graphs
Theoretical Computer Science | 2006-09-14 | Paper |
On the relationship between NLC-width and linear NLC-width
Theoretical Computer Science | 2005-12-29 | Paper |
Algorithms and Computation
Lecture Notes in Computer Science | 2005-12-22 | Paper |
A linear time approximation algorithm for movement minimization in conveyor flow shop processing
European Journal of Operational Research | 2004-11-22 | Paper |
| scientific article; zbMATH DE number 2044928 (Why is no real title available?) | 2004-02-18 | Paper |
Deciding Clique-Width for Graphs of Bounded Tree-Width
Journal of Graph Algorithms and Applications | 2003-11-30 | Paper |
Movement optimization in flow shop processing with buffers.
Mathematical Methods of Operations Research | 2003-10-16 | Paper |
The combinatorial complexity of masterkeying
Mathematical Methods of Operations Research | 2003-08-07 | Paper |
Movement minimization for unit distances in conveyor flow shop processing
Mathematical Methods of Operations Research | 2003-06-26 | Paper |
Node replacements in embedding normal form.
Journal of Computer and System Sciences | 2003-05-14 | Paper |
| scientific article; zbMATH DE number 1834662 (Why is no real title available?) | 2002-11-25 | Paper |
| scientific article; zbMATH DE number 1830724 (Why is no real title available?) | 2002-11-18 | Paper |
| scientific article; zbMATH DE number 1696534 (Why is no real title available?) | 2002-07-09 | Paper |
Stack-up algorithms for palletizing at delivery industry
European Journal of Operational Research | 2001-01-25 | Paper |
| scientific article; zbMATH DE number 1504826 (Why is no real title available?) | 2000-09-12 | Paper |
An approximation algorithm for the stack-up problem
Mathematical Methods of Operations Research | 2000-08-10 | Paper |
| scientific article; zbMATH DE number 1445308 (Why is no real title available?) | 2000-05-10 | Paper |
Polynomial-Time Analysis of Toroidal Periodic Graphs
Journal of Algorithms | 2000-03-16 | Paper |
Storage controlled pile-up systems, theoretical foundations
European Journal of Operational Research | 1999-10-05 | Paper |
| scientific article; zbMATH DE number 1346506 (Why is no real title available?) | 1999-10-03 | Paper |
| scientific article; zbMATH DE number 1333597 (Why is no real title available?) | 1999-09-19 | Paper |
| scientific article; zbMATH DE number 1264412 (Why is no real title available?) | 1999-03-16 | Paper |
The bounded degree problem for eNCE graph grammars
Information and Computation | 1997-08-11 | Paper |
Minimum Cost Paths in Periodic Graphs
SIAM Journal on Computing | 1996-06-09 | Paper |
Emptiness problems of eNCE graph languages
Journal of Computer and System Sciences | 1996-02-26 | Paper |
Undecidability of restricted uniform recurrence equations
Acta Informatica | 1995-11-19 | Paper |
\(k\)-NLC graphs and polynomial algorithms
Discrete Applied Mathematics | 1994-11-03 | Paper |
On the decidability of certain integer subgraph problems on context-free graph languages
Information and Computation | 1994-09-13 | Paper |
Bounded Tree-Width and LOGCFL
Journal of Algorithms | 1994-05-05 | Paper |
| scientific article; zbMATH DE number 512876 (Why is no real title available?) | 1994-03-10 | Paper |
The complexity of connectivity problems on context-free graph languages
Journal of Computer and System Sciences | 1994-01-01 | Paper |
| scientific article; zbMATH DE number 437576 (Why is no real title available?) | 1993-12-15 | Paper |
Efficient decision procedures for graph properties on context-free graph languages
Journal of the ACM | 1993-06-29 | Paper |
| scientific article; zbMATH DE number 177425 (Why is no real title available?) | 1993-05-18 | Paper |
| scientific article; zbMATH DE number 45244 (Why is no real title available?) | 1992-09-17 | Paper |
| scientific article; zbMATH DE number 17563 (Why is no real title available?) | 1992-06-26 | Paper |
Algorithms for graph problems on BNLC structured garphs
Information and Computation | 1992-06-25 | Paper |
Undecidability of the bandwidth problem on linear graph languages
Information Processing Letters | 1989-01-01 | Paper |
| scientific article; zbMATH DE number 4106284 (Why is no real title available?) | 1988-01-01 | Paper |
| scientific article; zbMATH DE number 4060749 (Why is no real title available?) | 1988-01-01 | Paper |
Efficient Solution of Connectivity Problems on Hierarchically Defined Graphs
SIAM Journal on Computing | 1988-01-01 | Paper |
