Dieter Mitsche

According to our database1, Dieter Mitsche authored at least 70 papers between 2003 and 2020.

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



In proceedings 
PhD thesis 




The height of depth-weighted random recursive trees.
Random Struct. Algorithms, 2020

Learning random points from geometric graphs or orderings.
Random Struct. Algorithms, 2020

<i>k</i>-regular subgraphs near the <i>k</i>-core threshold of a random graph.
J. Comb. Theory, Ser. B, 2020

On the Second Largest Component of Random Hyperbolic Graphs.
SIAM J. Discret. Math., 2019

Clique coloring of binomial random graphs.
Random Struct. Algorithms, 2019

Burning number of graph products.
Theor. Comput. Sci., 2018

The diameter of inhomogeneous random graphs.
Random Struct. Algorithms, 2018

On rigidity, orientability, and cores of random graphs with sliders.
Random Struct. Algorithms, 2018

Corrigendum to "On the limiting distribution of the metric dimension for random forests" [European J. Combin. 49(2015) 68-89].
Eur. J. Comb., 2018

Clique Colourings of Geometric Graphs.
Electron. J. Comb., 2018

Optimal Grid Drawings of Complete Multipartite Graphs and an Integer Variant of the Algebraic Connectivity.
Proceedings of the Graph Drawing and Network Visualization - 26th International Symposium, 2018

On Treewidth and Related Parameters of Random Geometric Graphs.
SIAM J. Discret. Math., 2017

Burning Graphs: A Probabilistic Perspective.
Graphs Comb., 2017

The Total Acquisition Number of Random Geometric Graphs.
Electron. J. Comb., 2017

Extending the metric dimension to graphs with missing edges.
Theor. Comput. Sci., 2016

A probabilistic version of the game of Zombies and Survivors on graphs.
Theor. Comput. Sci., 2016

Homophily, influence and the decay of segregation in self-organizing networks.
Netw. Sci., 2016

Maximum degree in minor-closed classes of graphs.
Eur. J. Comb., 2016

The set chromatic number of random graphs.
Discret. Appl. Math., 2016

Straightness of rectilinear vs. radio-concentric networks: modeling simulation and comparison.
CoRR, 2016

The Bondage Number of Random Graphs.
Electron. J. Comb., 2016

Modélisation, simulation et analyse de propriétés de réseaux orbitèles.
Rev. Int. Géomatique, 2015

On the limiting distribution of the metric dimension for random forests.
Eur. J. Comb., 2015

Strong-majority bootstrap percolation on regular graphs with low dissemination threshold.
CoRR, 2015

On-line List Colouring of Random Graphs.
Electron. J. Comb., 2015

The Domination Number of On-line Social Networks and Random Geometric Graphs.
Proceedings of the Theory and Applications of Models of Computation, 2015

A Bound for the Diameter of Random Hyperbolic Graphs.
Proceedings of the Twelfth Workshop on Analytic Algorithmics and Combinatorics, 2015

The random waypoint mobility model with uniform node spatial distribution.
Wirel. Networks, 2014

The Role of Visibility in Pursuit/Evasion Games.
Robotics, 2014

The number of empty four-gons in random point sets.
Electron. Notes Discret. Math., 2014

Independence densities of hypergraphs.
Eur. J. Comb., 2014

On the relation between graph distance and Euclidean distance in random geometric graphs.
CoRR, 2014

Dimensionality of social networks using motifs and eigenvalues.
CoRR, 2014

On the Hyperbolicity of Random Graphs.
Electron. J. Comb., 2014

Network observability for source localization in graphs with unobserved edges.
Proceedings of the 2014 IEEE Global Conference on Signal and Information Processing, 2014

Cops and invisible robbers: The cost of drunkenness.
Theor. Comput. Sci., 2013

On the Maximum Density of Graphs with Unique-Path Labelings.
SIAM J. Discret. Math., 2013

Vertex-Pursuit in Random Directed Acyclic Graphs.
SIAM J. Discret. Math., 2013

Revolutionaries and Spies on Random Graphs.
Comb. Probab. Comput., 2013

The robber strikes back.
CoRR, 2013

A Note on the Acquaintance Time of Random Graphs.
Electron. J. Comb., 2013

Metric Dimension for Random Graphs.
Electron. J. Comb., 2013

The Power of Mediation in an Extended El Farol Game.
Proceedings of the Algorithmic Game Theory - 6th International Symposium, 2013

Continuous monitoring in the dynamic sensor field model.
Theor. Comput. Sci., 2012

On the Fiedler value of large planar graphs
CoRR, 2012

Vertex-Pursuit in Hierarchical Social Networks.
Proceedings of the Theory and Applications of Models of Computation, 2012

Theoretical Aspects of Graph Models for MANETs.
Proceedings of the Theoretical Aspects of Distributed Computing in Sensor Networks, 2011

On the number of higher order Delaunay triangulations.
Theor. Comput. Sci., 2011

On the Fiedler value of large planar graphs (Extended abstract).
Electron. Notes Discret. Math., 2011

Social-Aware Forwarding Improves Routing Performance in Pocket Switched Networks.
Proceedings of the Algorithms - ESA 2011, 2011

Colorings at minimum cost.
Discret. Math., 2010

The cook-book approach to the differential equation method.
Comput. Sci. Rev., 2010

Large Connectivity for Dynamic Random Geometric Graphs.
IEEE Trans. Mob. Comput., 2009

On the satisfiability threshold of formulas with three literals per clause.
Theor. Comput. Sci., 2009

On the Power of Mediators.
Proceedings of the Internet and Network Economics, 5th International Workshop, 2009

Review of "Introduction to clustering large and high-dimensional data" by J. Kogan.
Comput. Sci. Rev., 2008

On the Probability of the Existence of Fixed-Size Components in Random Geometric Graphs
CoRR, 2008

On the connectivity of dynamic random geometric graphs.
Proceedings of the Nineteenth Annual ACM-SIAM Symposium on Discrete Algorithms, 2008

A new upper bound for 3-SAT.
Proceedings of the IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science, 2008

Sharp Threshold for Hamiltonicity of Random Geometric Graphs.
SIAM J. Discret. Math., 2007

Between Colorings and Layouts - Minimum Morphism Cost Problems.
Electron. Notes Discret. Math., 2007

Online balanced graph avoidance games.
Eur. J. Comb., 2007

Dynamic Random Geometric Graphs
CoRR, 2007

Collaborative Ranking: An Aggregation Algorithm for Individuals' Preference Estimation.
Proceedings of the Algorithmic Aspects in Information and Management, 2007

Bounding the Misclassification Error in Spectral Partitioning in the Planted Partition Model.
Proceedings of the Graph-Theoretic Concepts in Computer Science, 2005

Boosting Spectral Partitioning by Sampling and Iteration.
Proceedings of the Algorithms and Computation, 16th International Symposium, 2005

Reconstructing Many Partitions Using Spectral Techniques.
Proceedings of the Fundamentals of Computation Theory, 15th International Symposium, 2005

Off-line Admission Control for Advance Reservations in Star Networks.
Proceedings of the Approximation and Online Algorithms, Second International Workshop, 2004

Analysing Slices of Data Warehouses to Detect Structural Modifications.
Proceedings of the Advanced Information Systems Engineering, 16th International Conference, 2004

Automatic Detection of Structural Changes in Data Warehouses.
Proceedings of the Data Warehousing and Knowledge Discovery, 5th International Conference, 2003