Martin Milanic

According to our database1, Martin Milanic authored at least 116 papers between 2007 and 2020.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Other 

Links

Homepages:

On csauthors.net:

Bibliography

2020
Bipartite graphs of small readability.
Theor. Comput. Sci., 2020

Characterizing and decomposing classes of threshold, split, and bipartite graphs via 1-Sperner hypergraphs.
J. Graph Theory, 2020

Mind the independence gap.
Discret. Math., 2020

Shifting paths to avoidable ones.
CoRR, 2020

On the degree sequences of dual graphs on surfaces.
CoRR, 2020

Treewidth Versus Clique Number in Graph Classes with a Forbidden Structure.
Proceedings of the Graph-Theoretic Concepts in Computer Science, 2020

Strong Cliques in Diamond-Free Graphs.
Proceedings of the Graph-Theoretic Concepts in Computer Science, 2020

Edge Elimination and Weighted Graph Classes.
Proceedings of the Graph-Theoretic Concepts in Computer Science, 2020

Fair Packing of Independent Sets.
Proceedings of the Combinatorial Algorithms - 31st International Workshop, 2020

2019
New algorithms for weighted <i>k</i>-domination and total <i>k</i>-domination problems in proper interval graphs.
Theor. Comput. Sci., 2019

A dichotomy for weighted efficient dominating sets with bounded degree vertices.
Inf. Process. Lett., 2019

A Characterization of Claw-free CIS Graphs and New Results on the Order of CIS Graphs.
Proceedings of the tenth Latin and American Algorithms, Graphs and Optimization Symposium, 2019

Detecting strong cliques.
Discret. Math., 2019

Decomposing 1-Sperner Hypergraphs.
Electron. J. Comb., 2019

MIPUP: minimum perfect unmixed phylogenies for multi-sampled tumors via branchings and ILP.
Bioinform., 2019

Linear separation of connected dominating sets in graphs.
Ars Math. Contemp., 2019

Minimal Separators in Graph Classes Defined by Small Forbidden Induced Subgraphs.
Proceedings of the Graph-Theoretic Concepts in Computer Science, 2019

A Polynomial-Time Algorithm for the Independent Set Problem in P_10, C_4, C_6 -Free Graphs.
Proceedings of the Graph-Theoretic Concepts in Computer Science, 2019

Avoidable Vertices and Edges in Graphs.
Proceedings of the Algorithms and Data Structures - 16th International Symposium, 2019

2018
Minimum connected transversals in graphs: New hardness results and tractable cases using the price of connectivity.
Theor. Comput. Sci., 2018

Complexity and Algorithms for Finding a Perfect Phylogeny from Mixed Tumor Samples.
IEEE ACM Trans. Comput. Biol. Bioinform., 2018

Perfect Phylogenies via Branchings in Acyclic Digraphs and a Generalization of Dilworth's Theorem.
ACM Trans. Algorithms, 2018

On Almost Well-Covered Graphs of Girth at Least 6.
Discret. Math. Theor. Comput. Sci., 2018

On total domination in the Cartesian product of graphs.
Discuss. Math. Graph Theory, 2018

Graphs vertex-partitionable into strong cliques.
Discret. Math., 2018

1-perfectly orientable K4-minor-free and outerplanar graphs.
Discret. Appl. Math., 2018

Weighted efficient domination for some classes of H-free and of (H1, H2)-free graphs.
Discret. Appl. Math., 2018

A three-person deterministic graphical game without Nash equilibria.
Discret. Appl. Math., 2018

Domination parameters with number : Interrelations and algorithmic consequences.
Discret. Appl. Math., 2018

Preface: Special Issue on the Ninth International Colloquium on Graphs and Optimization (GO IX), 2014.
Discret. Appl. Math., 2018

Searching for square-complementary graphs: non-existence results and complexity of recognition.
CoRR, 2018

New Algorithms for Weighted k-Domination and Total k-Domination Problems in Proper Interval Graphs.
CoRR, 2018

Stable Sets in {ISK4, wheel}-Free Graphs.
Algorithmica, 2018

Improved Algorithms for k-Domination and Total k-Domination in Proper Interval Graphs.
Proceedings of the Combinatorial Optimization - 5th International Symposium, 2018

2017
Equistarable Graphs and Counterexamples to Three Conjectures on Equistable Graphs.
J. Graph Theory, 2017

Partial Characterizations of 1-Perfectly Orientable Graphs.
J. Graph Theory, 2017

Characterizations of minimal dominating sets and the well-dominated property in lexicographic product graphs.
Discret. Math. Theor. Comput. Sci., 2017

1-perfectly orientable graphs and graph products.
Discret. Math., 2017

On two extensions of equimatchable graphs.
Discret. Optim., 2017

On the complexity of the identifiable subgraph problem, revisited.
Discret. Appl. Math., 2017

Preface: Algorithmic Graph Theory on the Adriatic Coast.
Discret. Appl. Math., 2017

On equistable, split, CIS, and related classes of graphs.
Discret. Appl. Math., 2017

Almost Well-Covered Graphs Without Short Cycles.
CoRR, 2017

The minimum conflict-free row split problem revisited: a branching formulation and (in)approximability issues.
CoRR, 2017

Minimal dominating sets in lexicographic product graphs.
CoRR, 2017

The Minimum Conflict-Free Row Split Problem Revisited.
Proceedings of the Graph-Theoretic Concepts in Computer Science, 2017

Induced Embeddings into Hamming Graphs.
Proceedings of the 42nd International Symposium on Mathematical Foundations of Computer Science, 2017

2016
On Three Extensions of Equimatchable Graphs.
Electron. Notes Discret. Math., 2016

1-perfectly orientable K<sub>4</sub>-minor-free and outerplanar graphs.
Electron. Notes Discret. Math., 2016

The price of connectivity for cycle transversals.
Eur. J. Comb., 2016

Equistarable bipartite graphs.
Discret. Math., 2016

On the readability of overlap digraphs.
Discret. Appl. Math., 2016

Graph classes with and without powers of bounded clique-width.
Discret. Appl. Math., 2016

Strong cliques and equistability of EPT graphs.
Discret. Appl. Math., 2016

A threshold approach to connected domination.
CoRR, 2016

A three-person chess-like game without Nash equilibria.
CoRR, 2016

2015
On the complexity of the vector connectivity problem.
Theor. Comput. Sci., 2015

Spread of influence in weighted networks under time and budget constraints.
Theor. Comput. Sci., 2015

Group irregularity strength of connected graphs.
J. Comb. Optim., 2015

Polynomial-time algorithms for weighted efficient domination problems in AT-free graphs and dually chordal graphs.
Inf. Process. Lett., 2015

Vertex-transitive CIS graphs.
Eur. J. Comb., 2015

On the complexity of the identifiable subgraph problem.
Discret. Appl. Math., 2015

On a class of graphs between threshold and total domishold graphs.
Discret. Appl. Math., 2015

1-Sperner hypergraphs.
CoRR, 2015

Recognizing k-equistable Graphs in FPT Time.
Proceedings of the Graph-Theoretic Concepts in Computer Science, 2015

Finding a Perfect Phylogeny from Mixed Tumor Samples.
Proceedings of the Algorithms in Bioinformatics - 15th International Workshop, 2015

2014
Set graphs. II. Complexity of set graph recognition and similar problems.
Theor. Comput. Sci., 2014

Latency-bounded target set selection in social networks.
Theor. Comput. Sci., 2014

Vector connectivity in graphs.
Networks, 2014

Graphs Without Large Apples and the Maximum Weight Independent Set Problem.
Graphs Comb., 2014

Graphs whose complement and square are isomorphic.
Discret. Math., 2014

Dominating sequences in graphs.
Discret. Math., 2014

On CIS circulants.
Discret. Math., 2014

Set graphs. IV. Further connections with claw-freeness.
Discret. Appl. Math., 2014

A characterization of line graphs that are squares of graphs.
Discret. Appl. Math., 2014

Equistable simplicial, very well-covered, and line graphs.
Discret. Appl. Math., 2014

Total domishold graphs: A generalization of threshold graphs, with connections to threshold hypergraphs.
Discret. Appl. Math., 2014

On the structure of 1-perfectly orientable graphs.
CoRR, 2014

Graphs of Power-Bounded Clique-Width.
CoRR, 2014

How to go Viral: Cheaply and Quickly.
Proceedings of the Fun with Algorithms - 7th International Conference, 2014

2013
Hereditary Efficiently Dominatable Graphs.
J. Graph Theory, 2013

Critical properties of graphs of bounded clique-width.
Discret. Math., 2013

Set graphs. I. Hereditarily finite sets and extensional acyclic orientations.
Discret. Appl. Math., 2013

Computing square roots of trivially perfect and threshold graphs.
Discret. Appl. Math., 2013

Resilience and optimization of identifiable bipartite graphs.
Discret. Appl. Math., 2013

On the approximability and exact algorithms for vector domination and related problems in graphs.
Discret. Appl. Math., 2013

A note on domination and independence-domination numbers of graphs.
Ars Math. Contemp., 2013

Linear Separation of Total Dominating Sets in Graphs.
Proceedings of the Graph-Theoretic Concepts in Computer Science, 2013

New Polynomial Cases of the Weighted Efficient Domination Problem.
Proceedings of the Mathematical Foundations of Computer Science 2013, 2013

Induced Subtrees in Interval Graphs.
Proceedings of the Combinatorial Algorithms - 24th International Workshop, 2013

2012
Complexity of independent set reconfigurability problems.
Theor. Comput. Sci., 2012

Graphs of separability at most 2.
Discret. Appl. Math., 2012

On the Recognition of k-Equistable Graphs.
Proceedings of the Graph-Theoretic Concepts in Computer Science, 2012

2011
Shortest paths between shortest paths.
Theor. Comput. Sci., 2011

Equistable graphs, general partition graphs, triangle graphs, and graph products.
Discret. Appl. Math., 2011

Competitive Boolean function evaluation: Beyond monotonicity, and the symmetric case.
Discret. Appl. Math., 2011

Complexity results for equistable graphs and related classes.
Ann. Oper. Res., 2011

Competitive evaluation of threshold functions in the priced information model.
Ann. Oper. Res., 2011

Hardness, Approximability, and Exact Algorithms for Vector Domination and Total Vector Domination in Graphs.
Proceedings of the Fundamentals of Computation Theory - 18th International Symposium, 2011

A hereditary view on efficient domination.
Proceedings of the 10th Cologne-Twente Workshop on graphs and combinatorial optimization. Extended Abstracts, 2011

2010
On the Maximum Independent Set Problem in Subclasses of Planar Graphs.
J. Graph Algorithms Appl., 2010

Structural Identifiability in Low-Rank Matrix Factorization.
Algorithmica, 2010

Shortest Paths between Shortest Paths and Independent Sets.
Proceedings of the Combinatorial Algorithms - 21st International Workshop, 2010

Graphs of Separability at Most Two: Structural Characterizations and Their Consequences.
Proceedings of the Combinatorial Algorithms - 21st International Workshop, 2010

A Better Bouncer's Algorithm.
Proceedings of the Fun with Algorithms, 5th International Conference, 2010

2009
The Exact Weighted Independent Set Problem in Perfect Graphs and Related Classes.
Electron. Notes Discret. Math., 2009

On the Plane-Width of Graphs.
Electron. Notes Discret. Math., 2009

Recent developments on graphs of bounded clique-width.
Discret. Appl. Math., 2009

Simple and Fast Reoptimizations for the Steiner Tree Problem.
Algorithmic Oper. Res., 2009

2008
A polynomial algorithm to find an independent set of maximum weight in a fork-free graph.
J. Discrete Algorithms, 2008

On finding augmenting graphs.
Discret. Appl. Math., 2008

The Maximum Independent Set Problem in Planar Graphs.
Proceedings of the Mathematical Foundations of Computer Science 2008, 2008

Computing with Priced Information: When the Value Makes the Price.
Proceedings of the Algorithms and Computation, 19th International Symposium, 2008

2007
Tree-Width and Optimization in Bounded Degree Graphs.
Proceedings of the Graph-Theoretic Concepts in Computer Science, 2007

Maximum independent sets in graphs of low degree.
Proceedings of the Eighteenth Annual ACM-SIAM Symposium on Discrete Algorithms, 2007

On the maximum independent set problem in subclasses of planar and more general graphs.
Proceedings of the Sixth Cologne Twente Workshop on Graphs and Combinatorial Optimization, 2007


  Loading...