| Publication | Date of Publication | Type |
|---|
The knapsack problem with special neighbor constraints on directed co-graphs
| 2024-09-17 | Paper |
Oriented vertex and arc coloring of edge series-parallel digraphs
| 2024-09-17 | Paper |
Stability, vertex stability, and unfrozenness for special graph classes
Theory of Computing Systems | 2024-02-09 | Paper |
Characterizations and directed path-width of sequence digraphs
Theory of Computing Systems | 2023-05-02 | Paper |
Oriented coloring of msp-digraphs and oriented co-graphs (extended abstract)
| 2023-03-21 | Paper |
Directed width parameters on semicomplete digraphs
| 2022-06-29 | Paper |
Computing directed Steiner path covers
Journal of Combinatorial Optimization | 2022-04-13 | Paper |
The knapsack problem with special neighbor constraints
Mathematical Methods of Operations Research | 2022-04-08 | Paper |
Acyclic coloring parameterized by directed clique-width
| 2022-03-24 | Paper |
Efficient computation of the oriented chromatic number of recursively defined digraphs
Theoretical Computer Science | 2021-10-21 | Paper |
Homomorphisms to digraphs with large girth and oriented colorings of minimal series-parallel digraphs
| 2021-10-04 | Paper |
Subset sum problems with special digraph constraints
| 2021-08-30 | Paper |
Exact solutions for the Steiner path cover problem on special graph classes
| 2021-08-30 | Paper |
On characterizations for subclasses of directed co-graphs
Journal of Combinatorial Optimization | 2021-05-11 | Paper |
How to compute digraph width measures on directed co-graphs
Theoretical Computer Science | 2021-01-25 | Paper |
Efficient computation of the oriented chromatic number of recursively defined digraphs
| 2020-12-26 | Paper |
Solutions for subset sum problems with special digraph constraints
Mathematical Methods of Operations Research | 2020-12-15 | Paper |
Forbidden directed minors, directed path-width and directed tree-width of tree-like digraphs
| 2020-10-22 | Paper |
Counting and enumerating independent sets with applications to combinatorial optimization problems
Mathematical Methods of Operations Research | 2020-08-03 | Paper |
Computing directed Steiner path covers for directed co-graphs (extended abstract)
SOFSEM 2020: Theory and Practice of Computer Science | 2020-07-20 | Paper |
Characterizations for special directed co-graphs
| 2020-05-13 | Paper |
Computing digraph width measures on directed co-graphs (extended abstract)
| 2020-01-30 | Paper |
Controlling distribution conveyors and multiline palletizers: theoretical foundations and online algorithms
OR Spectrum | 2020-01-15 | Paper |
On the hardness of palletizing bins using FIFO queues
Theoretical Computer Science | 2019-10-18 | Paper |
Directed path-width of sequence digraphs
| 2019-10-11 | Paper |
Comparing linear width parameters for directed graphs
Theory of Computing Systems | 2019-09-05 | Paper |
Solutions for the knapsack problem with conflict and forcing graphs of bounded clique-width
Mathematical Methods of Operations Research | 2019-07-10 | Paper |
Oriented coloring on recursively defined digraphs
Algorithms | 2019-07-08 | Paper |
Knapsack problems: a parameterized point of view
Theoretical Computer Science | 2019-05-29 | Paper |
A graph theoretic approach to solve special knapsack problems in polynomial time
Operations Research Proceedings | 2018-10-09 | Paper |
Directed path-width and directed tree-width of directed co-graphs
| 2018-10-04 | Paper |
Computing directed path-width and directed tree-width of recursively defined digraphs
| 2018-06-12 | Paper |
An Experimental Study of Algorithms for Controlling Palletizers
Operations Research Proceedings | 2017-12-01 | Paper |
Computing partitions with applications to capital budgeting problems
Operations Research Proceedings | 2017-12-01 | Paper |
On-line algorithms for controlling palletizers
Operations Research Proceedings 2016 | 2017-12-01 | Paper |
Distributed solving of mixed-integer programs with GLPK and Thrift
Operations Research Proceedings 2016 | 2017-12-01 | Paper |
Change-making problems revisited: a parameterized point of view
Journal of Combinatorial Optimization | 2017-11-09 | Paper |
A practical approach for the FIFO stack-up problem
Advances in Intelligent Systems and Computing | 2017-09-12 | Paper |
Interval routing schemes for circular-arc graphs
International Journal of Foundations of Computer Science | 2017-04-26 | Paper |
The behavior of clique-width under graph operations and graph transformations
Theory of Computing Systems | 2017-03-31 | Paper |
Algorithms for controlling palletizers
Operations Research Proceedings | 2016-05-19 | Paper |
Capital budgeting problems: a parameterized point of view
Operations Research Proceedings | 2016-05-19 | 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 |
Neighbourhood-width of trees
Discrete Mathematics | 2015-10-08 | Paper |
Binary linear programming solutions and non-approximability for control problems in voting systems
Discrete Applied Mathematics | 2014-09-12 | Paper |
Exact algorithms for difficult graph problems
eXamen.press | 2010-07-19 | Paper |
Polynomial algorithms for protein similarity search for restricted mRNA structures
Information Processing Letters | 2010-03-24 | 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 |
Graph parameters measuring neighbourhoods in graphs-bounds and applications
Discrete Applied Mathematics | 2008-09-10 | 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 |
Characterizations for restricted graphs of NLC-width 2
Theoretical Computer Science | 2007-03-15 | 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 |
Linear layouts measuring neighbourhoods in graphs
Discrete Mathematics | 2006-09-13 | Paper |
Characterizations for co-graphs defined by restricted NLC-width or clique-width operations
Discrete Mathematics | 2006-03-29 | Paper |
On the relationship between NLC-width and linear NLC-width
Theoretical Computer Science | 2005-12-29 | 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 |
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 |
