Discover open access scientific publications

Search, annotate, share and cite publications

Publications by Stefan Ehard

Dynamic Monopolies for Interval Graphs With Bounded Thresholds

Discrete Applied Mathematics
CombinatoricsApplied MathematicsDiscrete Mathematics
2019English

Related publications

Sparse Universal Graphs for Bounded-Degree Graphs

Random Structures and Algorithms
MathematicsApplied MathematicsComputer GraphicsComputer-Aided DesignSoftware
2007English

Erdős–Hajnal Conjecture for Graphs With Bounded VC-Dimension

Discrete and Computational Geometry
CombinatoricsMathematicsGeometryDiscrete MathematicsComputational TheoryTopologyTheoretical Computer Science
2018English

Repetition Thresholds for Subdivided Graphs and Trees

RAIRO - Theoretical Informatics and Applications
MathematicsComputer Science ApplicationsSoftware
2011English

Tree Spanners for Bipartite Graphs and Probe Interval Graphs

Lecture Notes in Computer Science
Computer ScienceTheoretical Computer Science
2003English

Exploration of the T-Interval-Connected Dynamic Graphs: The Case of the Ring

Lecture Notes in Computer Science
Computer ScienceTheoretical Computer Science
2013English

Linear Algorithms for Partitioning Embedded Graphs of Bounded Genus

SIAM Journal on Discrete Mathematics
Mathematics
1996English

PTAS for Densest K-Subgraph in Interval Graphs

Lecture Notes in Computer Science
Computer ScienceTheoretical Computer Science
2011English

Distant Sum Distinguishing Index of Graphs With Bounded Minimum Degree

Ars Mathematica Contemporanea
AlgebraCombinatoricsNumber TheoryGeometryDiscrete MathematicsTheoretical Computer ScienceTopology
2019English

Improved Distributed Algorithms for Coloring Interval Graphs With Application to Multicoloring Trees

Theoretical Computer Science
Computer ScienceTheoretical Computer Science
2020English

Amanote Research

Note-taking for researchers

Follow Amanote

© 2026 Amaplex Software S.P.R.L. All rights reserved.

Privacy PolicyRefund Policy