Dominique Komander

Orcid: 0000-0001-6990-5164

According to our database1, Dominique Komander authored at least 22 papers between 2019 and 2023.

Collaborative distances:
  • Dijkstra number2 of five.
  • Erdős number3 of four.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2023
Twin-distance-hereditary digraphs.
Theor. Comput. Sci., August, 2023

2022
Correction to: Solutions for subset sum problems with special digraph constraints.
Math. Methods Oper. Res., 2022

The knapsack problem with special neighbor constraints.
Math. Methods Oper. Res., 2022

Computing directed Steiner path covers.
J. Comb. Optim., 2022

Efficient computation of oriented vertex and arc colorings of special digraphs.
CoRR, 2022

2021
How to compute digraph width measures on directed co-graphs.
Theor. Comput. Sci., 2021

Efficient computation of the oriented chromatic number of recursively defined digraphs.
Theor. Comput. Sci., 2021

On characterizations for subclasses of directed co-graphs.
J. Comb. Optim., 2021

Homomorphisms to Digraphs with Large Girth and Oriented Colorings of Minimal Series-Parallel Digraphs.
Proceedings of the WALCOM: Algorithms and Computation, 2021

Oriented Vertex and Arc Coloring of Edge Series-Parallel Digraphs.
Proceedings of the Operations Research Proceedings 2021, Selected Papers of the International Conference of the Swiss, German and Austrian Operations Research Societies (SVOR/ASRO, GOR e.V., ÖGOR), University of Bern, Switzerland, August 31, 2021

The Knapsack Problem with Special Neighbor Constraints on Directed Co-graphs.
Proceedings of the Operations Research Proceedings 2021, Selected Papers of the International Conference of the Swiss, German and Austrian Operations Research Societies (SVOR/ASRO, GOR e.V., ÖGOR), University of Bern, Switzerland, August 31, 2021

Directed Width Parameters on Semicomplete Digraphs.
Proceedings of the Combinatorial Optimization and Applications, 2021

Acyclic Coloring Parameterized by Directed Clique-Width.
Proceedings of the Algorithms and Discrete Applied Mathematics, 2021

2020
Solutions for subset sum problems with special digraph constraints.
Math. Methods Oper. Res., 2020

Acyclic coloring of special digraphs.
CoRR, 2020

Computing Directed Steiner Path Covers for Directed Co-graphs (Extended Abstract).
Proceedings of the SOFSEM 2020: Theory and Practice of Computer Science, 2020

Oriented Coloring of msp-Digraphs and Oriented Co-graphs (Extended Abstract).
Proceedings of the Combinatorial Optimization and Applications, 2020

2019
Oriented Coloring on Recursively Defined Digraphs.
Algorithms, 2019

Subset Sum Problems with Special Digraph Constraints.
Proceedings of the Operations Research Proceedings 2019, 2019

Exact Solutions for the Steiner Path Cover Problem on Special Graph Classes.
Proceedings of the Operations Research Proceedings 2019, 2019

Computing Digraph Width Measures on Directed Co-graphs - (Extended Abstract).
Proceedings of the Fundamentals of Computation Theory - 22nd International Symposium, 2019

Characterizations for Special Directed Co-graphs.
Proceedings of the Combinatorial Optimization and Applications, 2019


  Loading...