Dieter Mitsche

Publication Activity (10 Years)

Years Active: 2003-2024
Publications (10 Years): 35

Top Topics

Source Localization

Top Venues

Random Struct. Algorithms

Electron. J. Comb.

Publications

Lyuben Lichev, Dieter Mitsche, Guillem Perarnau
Percolation on dense random graphs with given degrees. J. Comb. Theory B 167 (2024)
Lyuben Lichev, Dieter Mitsche, Lutz Warnke
The jump of the clique chromatic number of random graphs. Random Struct. Algorithms 62 (4) (2023)
Lyuben Lichev, Dieter Mitsche
On the Minimum Bisection of Random 3-Regular Graphs. Electron. J. Comb. 30 (2) (2023)
Marcos Kiwi, Lyuben Lichev, Dieter Mitsche, Pawel Pralat
Label propagation on binomial random graphs. CoRR (2023)
Alberto Espuny Díaz, Lyuben Lichev, Dieter Mitsche, Alexandra Wesolek
Sharp threshold for embedding balanced spanning trees in random geometric graphs. CoRR (2023)
Lyuben Lichev, Dieter Mitsche, Pawel Pralat
Localization game for random geometric graphs. Eur. J. Comb. 108 (2023)
Lyuben Lichev, Dieter Mitsche
On the modularity of 3-regular random graphs and random graphs with given degree sequences. Random Struct. Algorithms 61 (4) (2022)
Nicolas Fraiman, Lyuben Lichev, Dieter Mitsche
On the Power of Choice for Boolean Functions. SIAM J. Discret. Math. 36 (3) (2022)
Lyuben Lichev, Dieter Mitsche, Lutz Warnke
The jump of the clique chromatic number of random graphs. CoRR (2021)
Nicolas Fraiman, Lyuben Lichev, Dieter Mitsche
On the power of choice for Boolean functions. CoRR (2021)
Josep Díaz, Dieter Mitsche
A survey of the modified Moran process and evolutionary graph theory. Comput. Sci. Rev. 39 (2021)
Michael Fuchs, Cecilia Holmgren, Dieter Mitsche, Ralph Neininger
A note on the independence number, domination number and related parameters of random binary search trees and random recursive trees. Discret. Appl. Math. 292 (2021)
Dieter Mitsche, Michael Molloy, Pawel Pralat
-core threshold of a random graph. J. Comb. Theory, Ser. B 142 (2020)
Josep Díaz, Colin McDiarmid, Dieter Mitsche
Learning random points from geometric graphs or orderings. Random Struct. Algorithms 57 (2) (2020)
Kevin Leckey, Dieter Mitsche, Nick Wormald
The height of depth-weighted random recursive trees. Random Struct. Algorithms 56 (3) (2020)
Marcos A. Kiwi, Dieter Mitsche
On the Second Largest Component of Random Hyperbolic Graphs. SIAM J. Discret. Math. 33 (4) (2019)
Colin McDiarmid, Dieter Mitsche, Pawel Pralat
Clique coloring of binomial random graphs. Random Struct. Algorithms 54 (4) (2019)
Ruy Fabila Monroy, Carlos Hidalgo-Toscano, Clemens Huemer, Dolores Lara, Dieter Mitsche
Optimal Grid Drawings of Complete Multipartite Graphs and an Integer Variant of the Algebraic Connectivity. CoRR (2018)
J. Barré, Marc Lelarge, Dieter Mitsche
On rigidity, orientability, and cores of random graphs with sliders. Random Struct. Algorithms 52 (3) (2018)
Josep Díaz, Colin McDiarmid, Dieter Mitsche
Learning random points from geometric graphs or orderings. CoRR (2018)
Nicolas Fraiman, Dieter Mitsche
The diameter of inhomogeneous random graphs. Random Struct. Algorithms 53 (2) (2018)
Ruy Fabila Monroy, Carlos Hidalgo-Toscano, Clemens Huemer, Dolores Lara, Dieter Mitsche
Optimal Grid Drawings of Complete Multipartite Graphs and an Integer Variant of the Algebraic Connectivity. Graph Drawing (2018)
Dieter Mitsche, Juanjo Rué
Corrigendum to "On the limiting distribution of the metric dimension for random forests" [European J. Combin. 49(2015) 68-89]. Eur. J. Comb. 67 (2018)
Colin McDiarmid, Dieter Mitsche, Pawel Pralat
Clique Colourings of Geometric Graphs. Electron. J. Comb. 25 (4) (2018)
Dieter Mitsche, Pawel Pralat, Elham Roshanbin
Burning number of graph products. Theor. Comput. Sci. 746 (2018)
Ewa J. Infeld, Dieter Mitsche, Pawel Pralat
The Total Acquisition Number of Random Geometric Graphs. Electron. J. Comb. 24 (3) (2017)
Dieter Mitsche, Pawel Pralat, Elham Roshanbin
Burning Graphs: A Probabilistic Perspective. Graphs Comb. 33 (2) (2017)
Dieter Mitsche, Guillem Perarnau
On Treewidth and Related Parameters of Random Geometric Graphs. SIAM J. Discret. Math. 31 (2) (2017)
Andrzej Dudek, Dieter Mitsche, Pawel Pralat
The set chromatic number of random graphs. Discret. Appl. Math. 215 (2016)
Adam Douglas Henry, Dieter Mitsche, Pawel Pralat
Homophily, influence and the decay of segregation in self-organizing networks. Netw. Sci. 4 (1) (2016)
Didier Josselin, Vincent Labatut, Dieter Mitsche
Straightness of rectilinear vs. radio-concentric networks: modeling simulation and comparison. CoRR (2016)
Dieter Mitsche, Xavier Pérez-Giménez, Pawel Pralat
The Bondage Number of Random Graphs. Electron. J. Comb. 23 (2) (2016)
Anthony Bonato, Dieter Mitsche, Xavier Pérez-Giménez, Pawel Pralat
A probabilistic version of the game of Zombies and Survivors on graphs. Theor. Comput. Sci. 655 (2016)
Sabina Zejnilovic, Dieter Mitsche, João Gomes, Bruno Sinopoli
Extending the metric dimension to graphs with missing edges. Theor. Comput. Sci. 609 (2016)
Omer Giménez, Dieter Mitsche, Marc Noy
Maximum degree in minor-closed classes of graphs. Eur. J. Comb. 55 (2016)
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
Modélisation, simulation et analyse de propriétés de réseaux orbitèles. Rev. Int. Géomatique 25 (4) (2015)
Dieter Mitsche, Pawel Pralat, Elham Roshanbin
Burning graphs - a probabilistic perspective. CoRR (2015)
Dieter Mitsche, Xavier Pérez-Giménez, Pawel Pralat
Strong-majority bootstrap percolation on regular graphs with low dissemination threshold. CoRR (2015)
Marcos A. Kiwi, Dieter Mitsche
A Bound for the Diameter of Random Hyperbolic Graphs. ANALCO (2015)
Alan M. Frieze, Dieter Mitsche, Xavier Pérez-Giménez, Pawel Pralat
On-line List Colouring of Random Graphs. Electron. J. Comb. 22 (2) (2015)
Alan M. Frieze, Dieter Mitsche, Xavier Pérez-Giménez, Pawel Pralat
On-line list colouring of random graphs. CoRR (2015)
Anthony Bonato, Dieter Mitsche, Xavier Pérez-Giménez, Pawel Pralat
A probabilistic version of the game of Zombies and Survivors on graphs. CoRR (2015)
Anthony Bonato, Marc Lozier, Dieter Mitsche, Xavier Pérez-Giménez, Pawel Pralat
The Domination Number of On-line Social Networks and Random Geometric Graphs. TAMC (2015)
Dieter Mitsche, Juanjo Rué
On the limiting distribution of the metric dimension for random forests. Eur. J. Comb. 49 (2015)
Anthony Bonato, Jason I. Brown, Dieter Mitsche, Pawel Pralat
Independence densities of hypergraphs. Eur. J. Comb. 40 (2014)
Athanasios Kehagias, Dieter Mitsche, Pawel Pralat
The Role of Visibility in Pursuit / Evasion Games. CoRR (2014)
Josep Díaz, Dieter Mitsche, Guillem Perarnau, Xavier Pérez-Giménez
On the relation between graph distance and Euclidean distance in random geometric graphs. CoRR (2014)
Ruy Fabila Monroy, Clemens Huemer, Dieter Mitsche
The number of empty four-gons in random point sets. Electron. Notes Discret. Math. 46 (2014)
Dieter Mitsche, Pawel Pralat
On the Hyperbolicity of Random Graphs. Electron. J. Comb. 21 (2) (2014)
Dieter Mitsche, Giovanni Resta, Paolo Santi
The random waypoint mobility model with uniform node spatial distribution. Wirel. Networks 20 (5) (2014)
Sabina Zejnilovic, Dieter Mitsche, João Gomes, Bruno Sinopoli
Network observability for source localization in graphs with unobserved edges. GlobalSIP (2014)
Athanasios Kehagias, Dieter Mitsche, Pawel Pralat
The Role of Visibility in Pursuit/Evasion Games. Robotics 3 (4) (2014)
Anthony Bonato, David F. Gleich, Myunghwan Kim, Dieter Mitsche, Pawel Pralat, Amanda Tian, Stephen J. Young
Dimensionality of social networks using motifs and eigenvalues. CoRR (2014)
Anthony Bonato, Marc Lozier, Dieter Mitsche, Xavier Pérez-Giménez, Pawel Pralat
The domination number of on-line social networks and random geometric graphs. CoRR (2014)
Dieter Mitsche, Pawel Pralat
Revolutionaries and Spies on Random Graphs. Comb. Probab. Comput. 22 (3) (2013)
William B. Kinnersley, Dieter Mitsche, Pawel Pralat
A Note on the Acquaintance Time of Random Graphs. Electron. J. Comb. 20 (3) (2013)
Abbas Mehrabian, Dieter Mitsche, Pawel Pralat
On the Maximum Density of Graphs with Unique-Path Labelings. SIAM J. Discret. Math. 27 (3) (2013)
Anthony Bonato, Stephen Finbow, Przemyslaw Gordinowicz, Ali Haidar, William B. Kinnersley, Dieter Mitsche, Pawel Pralat, Ladislav Stacho
The robber strikes back. CoRR (2013)
Athanasios Kehagias, Dieter Mitsche, Pawel Pralat
Cops and invisible robbers: The cost of drunkenness. Theor. Comput. Sci. 481 (2013)
Dieter Mitsche, George Saad, Jared Saia
The Power of Mediation in an Extended El Farol Game. SAGT (2013)
Dieter Mitsche, George Saad, Jared Saia
The Power of Mediation in an Extended El Farol Game. CoRR (2013)
Béla Bollobás, Dieter Mitsche, Pawel Pralat
Metric Dimension for Random Graphs. Electron. J. Comb. 20 (4) (2013)
Anthony Bonato, Dieter Mitsche, Pawel Pralat
Vertex-Pursuit in Random Directed Acyclic Graphs. SIAM J. Discret. Math. 27 (2) (2013)
Dieter Mitsche, Guillem Perarnau
On the treewidth and related parameters of random geometric graphs. STACS (2012)
Lali Barrière, Clemens Huemer, Dieter Mitsche, David Orden
On the Fiedler value of large planar graphs CoRR (2012)
Carme Àlvarez, Josep Díaz, Dieter Mitsche, Maria J. Serna
Continuous monitoring in the dynamic sensor field model. Theor. Comput. Sci. 463 (2012)
Anthony Bonato, Dieter Mitsche, Pawel Pralat
Vertex-Pursuit in Hierarchical Social Networks. TAMC (2012)
Athanasios Kehagias, Dieter Mitsche, Pawel Pralat
Cops and Invisible Robbers: the Cost of Drunkenness CoRR (2012)
Carme Àlvarez, Josep Díaz, Dieter Mitsche, Maria J. Serna
Continuous Monitoring in the Dynamic Sensor Field Model. ALGOSENSORS (2011)
Dieter Mitsche, Maria Saumell, Rodrigo I. Silveira
On the number of higher order Delaunay triangulations. Theor. Comput. Sci. 412 (29) (2011)
Josep Díaz, Alberto Marchetti-Spaccamela, Dieter Mitsche, Paolo Santi, Julinda Stefa
Social-Aware Forwarding Improves Routing Performance in Pocket Switched Networks. ESA (2011)
Lali Barrière, Clemens Huemer, Dieter Mitsche, David Orden
On the Fiedler value of large planar graphs (Extended abstract). Electron. Notes Discret. Math. 38 (2011)
Dieter Mitsche, Maria Saumell, Rodrigo I. Silveira
On the Number of Higher Order Delaunay Triangulations. CIAC (2010)
Josep Díaz, Dieter Mitsche
The cook-book approach to the differential equation method. Comput. Sci. Rev. 4 (3) (2010)
Dieter Mitsche, Maria Saumell, Rodrigo I. Silveira
On the Number of Higher Order Delaunay Triangulations CoRR (2010)
Robert Berke, Dieter Mitsche
Colorings at minimum cost. Discret. Math. 310 (3) (2010)
Josep Díaz, Alberto Marchetti-Spaccamela, Dieter Mitsche, Paolo Santi, Julinda Stefa
Social-Aware Forwarding Improves Routing Performance in Pocket Switched Networks CoRR (2010)
Josep Díaz, Lefteris M. Kirousis, Dieter Mitsche, Xavier Pérez-Giménez
On the satisfiability threshold of formulas with three literals per clause. Theor. Comput. Sci. 410 (30-32) (2009)
Josep Díaz, Dieter Mitsche, Xavier Pérez-Giménez
Large Connectivity for Dynamic Random Geometric Graphs. IEEE Trans. Mob. Comput. 8 (6) (2009)
Josep Díaz, Dieter Mitsche, Navin Rustagi, Jared Saia
On the Power of Mediators. WINE (2009)
Josep Díaz, Lefteris M. Kirousis, Dieter Mitsche, Xavier Pérez-Giménez
A new upper bound for 3-SAT. FSTTCS (2008)
Dieter Mitsche
Review of "Introduction to clustering large and high-dimensional data" by J. Kogan. Comput. Sci. Rev. 2 (1) (2008)
Josep Díaz, Dieter Mitsche, Xavier Pérez-Giménez
On the connectivity of dynamic random geometric graphs. SODA (2008)
Josep Díaz, Lefteris M. Kirousis, Dieter Mitsche, Xavier Pérez-Giménez
A new upper bound for 3-SAT CoRR (2008)
Josep Díaz, Dieter Mitsche, Xavier Pérez
On the Probability of the Existence of Fixed-Size Components in Random Geometric Graphs CoRR (2008)
Joachim Giesen, Dieter Mitsche, Eva Schuberth
Collaborative Ranking: An Aggregation Algorithm for Individuals' Preference Estimation. AAIM (2007)
Josep Díaz, Dieter Mitsche, Xavier Pérez
Dynamic Random Geometric Graphs CoRR (2007)
Martin Marciniszyn, Dieter Mitsche, Milos Stojakovic
Online balanced graph avoidance games. Eur. J. Comb. 28 (8) (2007)
Dieter Mitsche
Between Colorings and Layouts - Minimum Morphism Cost Problems. Electron. Notes Discret. Math. 28 (2007)
Josep Díaz, Dieter Mitsche, Xavier Pérez
Sharp Threshold for Hamiltonicity of Random Geometric Graphs. SIAM J. Discret. Math. 21 (1) (2007)
Josep Díaz, Dieter Mitsche, Xavier Pérez
Sharp threshold for hamiltonicity of random geometric graphs CoRR (2006)
Joachim Giesen, Dieter Mitsche
Reconstructing Many Partitions Using Spectral Techniques. FCT (2005)
Joachim Giesen, Dieter Mitsche
Bounding the Misclassification Error in Spectral Partitioning in the Planted Partition Model. WG (2005)
Joachim Giesen, Dieter Mitsche
Boosting Spectral Partitioning by Sampling and Iteration. ISAAC (2005)
Johann Eder, Christian Koncilia, Dieter Mitsche
Analysing Slices of Data Warehouses to Detect Structural Modifications. CAiSE (2004)
Udo Adamy, Thomas Erlebach, Dieter Mitsche, Ingo Schurr, Bettina Speckmann, Emo Welzl
Off-line Admission Control for Advance Reservations in Star Networks. WAOA (2004)
Johann Eder, Christian Koncilia, Dieter Mitsche
Automatic Detection of Structural Changes in Data Warehouses. DaWaK (2003)