Frank Gurski

Directed Width Parameters on Semicomplete Digraphs.

[BibT_eX]

[DOI]

Sebastian Wiederrecht

Proceedings of the Combinatorial Optimization and Applications, 2021

Acyclic Coloring Parameterized by Directed Clique-Width.

[BibT_eX]

[DOI]

Proceedings of the Algorithms and Discrete Applied Mathematics, 2021

2020

Counting and enumerating independent sets with applications to combinatorial optimization problems.

[BibT_eX]

[DOI]

Math. Methods Oper. Res., 2020

Solutions for subset sum problems with special digraph constraints.

[BibT_eX]

[DOI]

Math. Methods Oper. Res., 2020

Acyclic coloring of special digraphs.

[BibT_eX]

[DOI]

CoRR, 2020

Computing Directed Steiner Path Covers for Directed Co-graphs (Extended Abstract).

[BibT_eX]

[DOI]

Proceedings of the SOFSEM 2020: Theory and Practice of Computer Science, 2020

Oriented Coloring of msp-Digraphs and Oriented Co-graphs (Extended Abstract).

[BibT_eX]

[DOI]

Marvin Lindemann

Proceedings of the Combinatorial Optimization and Applications, 2020

2019

On the hardness of palletizing bins using FIFO queues.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2019

Knapsack problems: A parameterized point of view.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2019

Controlling distribution conveyors and multiline palletizers: theoretical foundations and online algorithms.

[BibT_eX]

[DOI]

OR Spectr., 2019

Comparing Linear Width Parameters for Directed Graphs.

[BibT_eX]

[DOI]

Theory Comput. Syst., 2019

Solutions for the knapsack problem with conflict and forcing graphs of bounded clique-width.

[BibT_eX]

[DOI]

Math. Methods Oper. Res., 2019

Oriented Coloring on Recursively Defined Digraphs.

[BibT_eX]

[DOI]

Algorithms, 2019

Forbidden Directed Minors, Directed Path-Width and Directed Tree-Width of Tree-Like Digraphs.

[BibT_eX]

[DOI]

Proceedings of the SOFSEM 2019: Theory and Practice of Computer Science, 2019

Subset Sum Problems with Special Digraph Constraints.

[BibT_eX]

[DOI]

Proceedings of the Operations Research Proceedings 2019, 2019

Exact Solutions for the Steiner Path Cover Problem on Special Graph Classes.

[BibT_eX]

[DOI]

Proceedings of the Operations Research Proceedings 2019, 2019

Computing Digraph Width Measures on Directed Co-graphs - (Extended Abstract).

[BibT_eX]

[DOI]

Proceedings of the Fundamentals of Computation Theory - 22nd International Symposium, 2019

Characterizations for Special Directed Co-graphs.

[BibT_eX]

[DOI]

Proceedings of the Combinatorial Optimization and Applications, 2019

2018

Computing directed path-width and directed tree-width of recursively defined digraphs.

[BibT_eX]

[DOI]

CoRR, 2018

The Knapsack Problem with Conflict Graphs and Forcing Graphs of Bounded Clique-Width.

[BibT_eX]

[DOI]

Proceedings of the Operations Research Proceedings 2018, 2018

Directed Path-Width and Directed Tree-Width of Directed Co-graphs.

[BibT_eX]

[DOI]

Proceedings of the Computing and Combinatorics - 24th International Conference, 2018

Directed Path-Width of Sequence Digraphs.

[BibT_eX]

[DOI]

Proceedings of the Combinatorial Optimization and Applications, 2018

2017

The Behavior of Clique-Width under Graph Operations and Graph Transformations.

[BibT_eX]

[DOI]

Theory Comput. Syst., 2017

Change-making problems revisited: a parameterized point of view.

[BibT_eX]

[DOI]

J. Comb. Optim., 2017

Interval Routing Schemes for Circular-Arc Graphs.

[BibT_eX]

[DOI]

Patrick Gwydion Poullie

Int. J. Found. Comput. Sci., 2017

Counting and Enumerating Independent Sets with Applications to Knapsack Problems.

[BibT_eX]

[DOI]

CoRR, 2017

A Graph Theoretic Approach to Solve Special Knapsack Problems in Polynomial Time.

[BibT_eX]

[DOI]

Proceedings of the Operations Research Proceedings 2017, 2017

2016

Directed NLC-width.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2016

On the complexity of the FIFO stack-up problem.

[BibT_eX]

[DOI]

Math. Methods Oper. Res., 2016

Neighbourhood-width of trees.

[BibT_eX]

[DOI]

Stefan Neidig

Discret. Math., 2016

Knapsack Problems: A Parameterized Point of View.

[BibT_eX]

[DOI]

CoRR, 2016

On-Line Algorithms for Controlling Palletizers.

[BibT_eX]

[DOI]

Proceedings of the Operations Research Proceedings 2016, Selected Papers of the Annual International Conference of the German Operations Research Society (GOR), Helmut Schmidt University Hamburg, Germany, August 30, 2016

Distributed Solving of Mixed-Integer Programs with GLPK and Thrift.

[BibT_eX]

[DOI]

2015

Integer Programming Models and Parameterized Algorithms for Controlling Palletizers.

[BibT_eX]

[DOI]

CoRR, 2015

Linear Programming Formulations for Computing Graph Layout Parameters.

[BibT_eX]

[DOI]

Comput. J., 2015

Computing Partitions with Applications to Capital Budgeting Problems.

[BibT_eX]

[DOI]

Proceedings of the Operations Research Proceedings 2015, 2015

An Experimental Study of Algorithms for Controlling Palletizers.

[BibT_eX]

[DOI]

Proceedings of the Operations Research Proceedings 2015, 2015

A Practical Approach for the FIFO Stack-Up Problem.

[BibT_eX]

[DOI]

Proceedings of the Modelling, Computation and Optimization in Information Systems and Management Sciences - Proceedings of the 3rd International Conference on Modelling, Computation and Optimization in Information Systems and Management Sciences, 2015

Directed Pathwidth and Palletizers.

[BibT_eX]

[DOI]

Proceedings of the Combinatorial Optimization and Applications, 2015

2014

Binary linear programming solutions and non-approximability for control problems in voting systems.

[BibT_eX]

[DOI]

Magnus Roos

Discret. Appl. Math., 2014

Capital Budgeting Problems: A Parameterized Point of View.

[BibT_eX]

[DOI]

Proceedings of the Operations Research Proceedings 2014, 2014

Algorithms for Controlling Palletizers.

[BibT_eX]

[DOI]

Proceedings of the Operations Research Proceedings 2014, 2014

2013

Moving Bins from Conveyor Belts onto Pallets Using FIFO Queues.

[BibT_eX]

[DOI]

Proceedings of the Operations Research Proceedings 2013, 2013

2010

Exakte Algorithmen für schwere Graphenprobleme.

[BibT_eX]

[DOI]

eXamen.press, Springer, ISBN: 978-3-642-04499-1, 2010

2009

The NLC-width and clique-width for powers of graphs of bounded tree-width.

[BibT_eX]

[DOI]

Discret. Appl. Math., 2009

On Module-Composed Graphs.

[BibT_eX]

[DOI]

Proceedings of the Graph-Theoretic Concepts in Computer Science, 2009

2008

Polynomial algorithms for protein similarity search for restricted mRNA structures.

[BibT_eX]

[DOI]

Inf. Process. Lett., 2008

Graph parameters measuring neighbourhoods in graphs - Bounds and applications.

[BibT_eX]

[DOI]

Discret. Appl. Math., 2008

A comparison of two approaches for polynomial time algorithms computing basic graph parameters

[BibT_eX]

[DOI]

CoRR, 2008

2007

Characterizations for restricted graphs of NLC-width 2.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2007

Line graphs of bounded clique-width.

[BibT_eX]

[DOI]

Discret. Math., 2007

A local characterization of bounded clique-width for line graphs.

[BibT_eX]

[DOI]

Discret. Math., 2007

Graph Operations on Clique-Width Bounded Graphs

[BibT_eX]

[DOI]

CoRR, 2007

A note on module-composed graphs

[BibT_eX]

[DOI]

CoRR, 2007

The Clique-Width of Tree-Power and Leaf-Power Graphs.

[BibT_eX]

[DOI]

Proceedings of the Graph-Theoretic Concepts in Computer Science, 2007

2006

Vertex disjoint paths on clique-width bounded graphs.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2006

Linear layouts measuring neighbourhoods in graphs.

[BibT_eX]

[DOI]

Discret. Math., 2006

Characterizations for co-graphs defined by restricted NLC-width or clique-width operations.

[BibT_eX]

[DOI]

Discret. Math., 2006

2005

On the relationship between NLC-width and linear NLC-width.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2005

Minimizing NLC-Width is NP-Complete.

[BibT_eX]

[DOI]

Proceedings of the Graph-Theoretic Concepts in Computer Science, 2005

2003

Effiziente Algorithmen für baumstrukturierte Graphklassen.

[BibT_eX]

[DOI]

PhD thesis, 2003

Deciding Clique-Width for Graphs of Bounded Tree-Width.

[BibT_eX]

[DOI]

Wolfgang Espelage

J. Graph Algorithms Appl., 2003

2001

How to Solve NP-hard Graph Problems on Clique-Width Bounded Graphs in Polynomial Time.

[BibT_eX]

[DOI]

Wolfgang Espelage

Proceedings of the Graph-Theoretic Concepts in Computer Science, 2001

2000

The Tree-Width of Clique-Width Bounded Graphs Without <i>K<sub>n, n</sub></i>.

[BibT_eX]

[DOI]