Dieter Mitsche

According to our database, Dieter Mitsche authored at least 79 papers between 2003 and 2023.

Collaborative distances:

• Dijkstra number of four.
• Erdős number of two.

2023

Localization game for random geometric graphs.

Lyuben Lichev, Dieter Mitsche, Pawel Pralat

Eur. J. Comb., 2023

Sharp threshold for embedding balanced spanning trees in random geometric graphs.

Alberto Espuny Díaz, Lyuben Lichev, Dieter Mitsche, Alexandra Wesolek

CoRR, 2023

Label propagation on binomial random graphs.

Marcos Kiwi, Lyuben Lichev, Dieter Mitsche, Pawel Pralat

CoRR, 2023

On the Minimum Bisection of Random 3-Regular Graphs.

Lyuben Lichev, Dieter Mitsche

Electron. J. Comb., 2023

2022

On the Power of Choice for Boolean Functions.

Nicolas Fraiman, Lyuben Lichev, Dieter Mitsche

SIAM J. Discret. Math., September, 2022

On the modularity of 3-regular random graphs and random graphs with given degree sequences.

Lyuben Lichev, Dieter Mitsche

Random Struct. Algorithms, 2022

2021

A note on the independence number, domination number and related parameters of random binary search trees and random recursive trees.

Michael Fuchs, Cecilia Holmgren, Dieter Mitsche, Ralph Neininger

Discret. Appl. Math., 2021

A survey of the modified Moran process and evolutionary graph theory.

Josep Díaz, Dieter Mitsche

Comput. Sci. Rev., 2021

The jump of the clique chromatic number of random graphs.

Lyuben Lichev, Dieter Mitsche, Lutz Warnke

CoRR, 2021

2020

The height of depth-weighted random recursive trees.

Kevin Leckey, Dieter Mitsche, Nick Wormald

Random Struct. Algorithms, 2020

Learning random points from geometric graphs or orderings.

Josep Díaz, Colin McDiarmid, Dieter Mitsche

Random Struct. Algorithms, 2020

<i>k</i>-regular subgraphs near the <i>k</i>-core threshold of a random graph.

Dieter Mitsche, Michael Molloy, Pawel Pralat

J. Comb. Theory, Ser. B, 2020

2019

On the Second Largest Component of Random Hyperbolic Graphs.

Marcos A. Kiwi, Dieter Mitsche

SIAM J. Discret. Math., 2019

Clique coloring of binomial random graphs.

Colin McDiarmid, Dieter Mitsche, Pawel Pralat

Random Struct. Algorithms, 2019

2018

Burning number of graph products.

Dieter Mitsche, Pawel Pralat, Elham Roshanbin

Theor. Comput. Sci., 2018

The diameter of inhomogeneous random graphs.

Nicolas Fraiman, Dieter Mitsche

Random Struct. Algorithms, 2018

On rigidity, orientability, and cores of random graphs with sliders.

J. Barré, Marc Lelarge, Dieter Mitsche

Random Struct. Algorithms, 2018

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

Dieter Mitsche, Juanjo Rué

Eur. J. Comb., 2018

Clique Colourings of Geometric Graphs.

Colin McDiarmid, Dieter Mitsche, Pawel Pralat

Electron. J. Comb., 2018

Optimal Grid Drawings of Complete Multipartite Graphs and an Integer Variant of the Algebraic Connectivity.

Ruy Fabila Monroy, Carlos Hidalgo-Toscano, Clemens Huemer, Dolores Lara, Dieter Mitsche

Proceedings of the Graph Drawing and Network Visualization - 26th International Symposium, 2018

2017

On Treewidth and Related Parameters of Random Geometric Graphs.

Dieter Mitsche, Guillem Perarnau

SIAM J. Discret. Math., 2017

Burning Graphs: A Probabilistic Perspective.

Dieter Mitsche, Pawel Pralat, Elham Roshanbin

Graphs Comb., 2017

The Total Acquisition Number of Random Geometric Graphs.

Ewa J. Infeld, Dieter Mitsche, Pawel Pralat

Electron. J. Comb., 2017

2016

Extending the metric dimension to graphs with missing edges.

Sabina Zejnilovic, Dieter Mitsche, João Gomes, Bruno Sinopoli

Theor. Comput. Sci., 2016

A probabilistic version of the game of Zombies and Survivors on graphs.

Anthony Bonato, Dieter Mitsche, Xavier Pérez-Giménez, Pawel Pralat

Theor. Comput. Sci., 2016

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

Adam Douglas Henry, Dieter Mitsche, Pawel Pralat

Netw. Sci., 2016

Maximum degree in minor-closed classes of graphs.

Omer Giménez, Dieter Mitsche, Marc Noy

Eur. J. Comb., 2016

The set chromatic number of random graphs.

Andrzej Dudek, Dieter Mitsche, Pawel Pralat

Discret. Appl. Math., 2016

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

Didier Josselin, Vincent Labatut, Dieter Mitsche

CoRR, 2016

The Bondage Number of Random Graphs.

Dieter Mitsche, Xavier Pérez-Giménez, Pawel Pralat

Electron. J. Comb., 2016

2015

Modélisation, simulation et analyse de propriétés de réseaux orbitèles.

Didier Josselin, Sonia Chekir, Alain Pasquet, Vincent Labatut, Yvan Capowiez, Christophe Mazzia, Yezekael Hayel, Adrien Lammoglia, Cyrille Genre-Grandpierre, Dieter Mitsche, Frédéric Patras

Rev. Int. Géomatique, 2015

On the limiting distribution of the metric dimension for random forests.

Dieter Mitsche, Juanjo Rué

Eur. J. Comb., 2015

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

Dieter Mitsche, Xavier Pérez-Giménez, Pawel Pralat

CoRR, 2015

On-line List Colouring of Random Graphs.

Alan M. Frieze, Dieter Mitsche, Xavier Pérez-Giménez, Pawel Pralat

Electron. J. Comb., 2015

The Domination Number of On-line Social Networks and Random Geometric Graphs.

Anthony Bonato, Marc Lozier, Dieter Mitsche, Xavier Pérez-Giménez, Pawel Pralat

Proceedings of the Theory and Applications of Models of Computation, 2015

A Bound for the Diameter of Random Hyperbolic Graphs.

Marcos A. Kiwi, Dieter Mitsche

Proceedings of the Twelfth Workshop on Analytic Algorithmics and Combinatorics, 2015

2014

The random waypoint mobility model with uniform node spatial distribution.

Dieter Mitsche, Giovanni Resta, Paolo Santi

Wirel. Networks, 2014

The Role of Visibility in Pursuit/Evasion Games.

Athanasios Kehagias, Dieter Mitsche, Pawel Pralat

Robotics, 2014

The number of empty four-gons in random point sets.

Ruy Fabila Monroy, Clemens Huemer, Dieter Mitsche

Electron. Notes Discret. Math., 2014

Independence densities of hypergraphs.

Anthony Bonato, Jason I. Brown, Dieter Mitsche, Pawel Pralat

Eur. J. Comb., 2014

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

Josep Díaz, Dieter Mitsche, Guillem Perarnau, Xavier Pérez-Giménez

CoRR, 2014

Dimensionality of social networks using motifs and eigenvalues.

Anthony Bonato, David F. Gleich, Myunghwan Kim, Dieter Mitsche, Pawel Pralat, Amanda Tian, Stephen J. Young

CoRR, 2014

On the Hyperbolicity of Random Graphs.

Dieter Mitsche, Pawel Pralat

Electron. J. Comb., 2014

Network observability for source localization in graphs with unobserved edges.

Sabina Zejnilovic, Dieter Mitsche, João Gomes, Bruno Sinopoli

Proceedings of the 2014 IEEE Global Conference on Signal and Information Processing, 2014

2013

Cops and invisible robbers: The cost of drunkenness.

Athanasios Kehagias, Dieter Mitsche, Pawel Pralat

Theor. Comput. Sci., 2013

On the Maximum Density of Graphs with Unique-Path Labelings.

Abbas Mehrabian, Dieter Mitsche, Pawel Pralat

SIAM J. Discret. Math., 2013

Vertex-Pursuit in Random Directed Acyclic Graphs.

Anthony Bonato, Dieter Mitsche, Pawel Pralat

SIAM J. Discret. Math., 2013

Revolutionaries and Spies on Random Graphs.

Dieter Mitsche, Pawel Pralat

Comb. Probab. Comput., 2013

The robber strikes back.

Anthony Bonato, Stephen Finbow, Przemyslaw Gordinowicz, Ali Haidar, William B. Kinnersley, Dieter Mitsche, Pawel Pralat, Ladislav Stacho

CoRR, 2013

A Note on the Acquaintance Time of Random Graphs.

William B. Kinnersley, Dieter Mitsche, Pawel Pralat

Electron. J. Comb., 2013

Metric Dimension for Random Graphs.

Béla Bollobás, Dieter Mitsche, Pawel Pralat

Electron. J. Comb., 2013

The Power of Mediation in an Extended El Farol Game.

Dieter Mitsche, George Saad, Jared Saia

Proceedings of the Algorithmic Game Theory - 6th International Symposium, 2013

2012

Continuous monitoring in the dynamic sensor field model.

Carme Àlvarez, Josep Díaz, Dieter Mitsche, Maria J. Serna

Theor. Comput. Sci., 2012

On the Fiedler value of large planar graphs

Lali Barrière, Clemens Huemer, Dieter Mitsche, David Orden

CoRR, 2012

Vertex-Pursuit in Hierarchical Social Networks.

Anthony Bonato, Dieter Mitsche, Pawel Pralat

Proceedings of the Theory and Applications of Models of Computation, 2012

2011

Theoretical Aspects of Graph Models for MANETs.

Josep Díaz, Dieter Mitsche, Paolo Santi

Proceedings of the Theoretical Aspects of Distributed Computing in Sensor Networks, 2011

On the number of higher order Delaunay triangulations.

Dieter Mitsche, Maria Saumell, Rodrigo I. Silveira

Theor. Comput. Sci., 2011

On the Fiedler value of large planar graphs (Extended abstract).

Lali Barrière, Clemens Huemer, Dieter Mitsche, David Orden

Electron. Notes Discret. Math., 2011

Social-Aware Forwarding Improves Routing Performance in Pocket Switched Networks.

Josep Díaz, Alberto Marchetti-Spaccamela, Dieter Mitsche, Paolo Santi, Julinda Stefa

Proceedings of the Algorithms - ESA 2011, 2011

2010

Colorings at minimum cost.

Robert Berke, Dieter Mitsche

Discret. Math., 2010

The cook-book approach to the differential equation method.

Josep Díaz, Dieter Mitsche

Comput. Sci. Rev., 2010

2009

Large Connectivity for Dynamic Random Geometric Graphs.

Josep Díaz, Dieter Mitsche, Xavier Pérez-Giménez

IEEE Trans. Mob. Comput., 2009

On the satisfiability threshold of formulas with three literals per clause.

Josep Díaz, Lefteris M. Kirousis, Dieter Mitsche, Xavier Pérez-Giménez

Theor. Comput. Sci., 2009

On the Power of Mediators.

Josep Díaz, Dieter Mitsche, Navin Rustagi, Jared Saia

Proceedings of the Internet and Network Economics, 5th International Workshop, 2009

2008

Review of "Introduction to clustering large and high-dimensional data" by J. Kogan.

Dieter Mitsche

Comput. Sci. Rev., 2008

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

Josep Díaz, Dieter Mitsche, Xavier Pérez-Giménez

CoRR, 2008

On the connectivity of dynamic random geometric graphs.

Josep Díaz, Dieter Mitsche, Xavier Pérez-Giménez

Proceedings of the Nineteenth Annual ACM-SIAM Symposium on Discrete Algorithms, 2008

A new upper bound for 3-SAT.

Josep Díaz, Lefteris M. Kirousis, Dieter Mitsche, Xavier Pérez-Giménez

Proceedings of the IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science, 2008

2007

Sharp Threshold for Hamiltonicity of Random Geometric Graphs.

Josep Díaz, Dieter Mitsche, Xavier Pérez-Giménez

SIAM J. Discret. Math., 2007

Between Colorings and Layouts - Minimum Morphism Cost Problems.

Dieter Mitsche

Electron. Notes Discret. Math., 2007

Online balanced graph avoidance games.

Martin Marciniszyn, Dieter Mitsche, Milos Stojakovic

Eur. J. Comb., 2007

Dynamic Random Geometric Graphs

Josep Díaz, Dieter Mitsche, Xavier Pérez-Giménez

CoRR, 2007

Collaborative Ranking: An Aggregation Algorithm for Individuals' Preference Estimation.

Joachim Giesen, Dieter Mitsche, Eva Schuberth

Proceedings of the Algorithmic Aspects in Information and Management, 2007

2005

Bounding the Misclassification Error in Spectral Partitioning in the Planted Partition Model.

Joachim Giesen, Dieter Mitsche

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

Boosting Spectral Partitioning by Sampling and Iteration.

Joachim Giesen, Dieter Mitsche

Proceedings of the Algorithms and Computation, 16th International Symposium, 2005

Reconstructing Many Partitions Using Spectral Techniques.

Joachim Giesen, Dieter Mitsche

Proceedings of the Fundamentals of Computation Theory, 15th International Symposium, 2005

2004

Off-line Admission Control for Advance Reservations in Star Networks.

Udo Adamy, Thomas Erlebach, Dieter Mitsche, Ingo Schurr, Bettina Speckmann, Emo Welzl

Proceedings of the Approximation and Online Algorithms, Second International Workshop, 2004

Analysing Slices of Data Warehouses to Detect Structural Modifications.

Johann Eder, Christian Koncilia, Dieter Mitsche

Proceedings of the Advanced Information Systems Engineering, 16th International Conference, 2004

2003

Automatic Detection of Structural Changes in Data Warehouses.

Johann Eder, Christian Koncilia, Dieter Mitsche

Proceedings of the Data Warehousing and Knowledge Discovery, 5th International Conference, 2003