Submitted papers

• J. Jorritsma, J. Komjáthy, D. Mitsche: Cluster-size decay in supercritical kernel-based spatial grandom graphs
• J. Jorritsma, J. Komjáthy, D. Mitsche: Cluster-size decay in supercritical long-range percolation
• M. Kiwi, L. Lichev, D. Mitsche, P. Prałat: Label propagation on binomial random graphs
• L. Attia, L. Lichev, D. Mitsche, R, Saona, B. Ziliotto: Zero-sum Random Games on Directed Graphs

Publications in Journals

• L. Lichev, D. Mitsche: New results for the random nearest neighbor tree. Probability Theory and Related Fields, to appear.
• L. Lichev, D. Mitsche, G. Perarnau: Percolation on dense random graphs with given degrees. Journal of Combinatorial Theory Series B, to appear.
• A. Espuny Díaz, L. Lichev, D. Mitsche, A. Wesolek: Sharp threshold for embedding balanced spanning trees in random geometric graphs. Journal of Graph Theory, to appear.
• M. Kiwi, A. Linker, D. Mitsche: Tail bounds for detection times in mobile hyperbolic graphs. Annales de l'Institut Henri Poincaré Probabilités et Statistiques, to appear.
• L. Lichev, D. Mitsche, L. Warnke: The jump of the clique chromatic number of random graphs. Random Structures and Algorithms, 62(4) (2023), 1016-1034.
• L. Lichev, B. Lodewijks, D. Mitsche. B. Schapira: On the first and second largest components in the percolated Random Geometric Graph. Stochastic Processes and its Applications, 164 (2023), 311-336.
• L. Lichev, D. Mitsche: On the minimum bisection of random 3-regular graphs. Electronic Journal of Combinatorics 30(2) (2023), P2.40.(Maple file 1 section 5)(Maple file 2 section 5)(Python file section 6)
• L. Lichev, D. Mitsche, P. Prałat: Localization game for random geometric graphs. European Journal of Combinatorics, 108 (2022), 103616.
• N. Fraiman, L. Lichev, D. Mitsche: On the power of choice for Boolean functions. SIAM Journal on Discrete Mathematics, 36(3) (2022), 10.1137/21M1449245.
• L. Lichev, D. Mitsche: On the modularity of 3-regular random graphs and random graphs with given degree sequences. Random Structures and Algorithms, 61(4) (2022), 754-802.
• D. Mitsche, M. Penrose: Limit theory of combinatorial optimization for random geometric graphs. Annals of Applied Probability, 31(6) (2021), 2721-2771.
• A. Linker, D. Mitsche, B. Schapira, D. Valesin: The contact process on random hyperbolic graphs: metastability and critical exponents. Annals of Probability, 49(3) (2021), 1480-1514.
• R. Diel, D. Mitsche: On the largest component of subcritical hyperbolic random graphs. Electronic Communications of Probability, 26 (2021), 1-14.
• N. Fountoulakis, D. Mitsche, T. Müller, M. Schepers: Hamilton cycles and perfect matchings in the KPKVB model. Stochastic Processes and their Applications, 131 (2021), 340-358.
• M. Fuchs, C. Holmgren, D. Mitsche, R. Neininger: A note on the independence number, domination number and related parameters of random binary search trees and random recursive trees. Discrete Applied Mathematics, 292 (2021), 64-71.
• J. Díaz, C. McDiarmid, D. Mitsche: Learning random points from geometric graphs or orderings. Random Structures and Algorithms, 57(2) (2020), 339-370.
• D. Mitsche, M. Molloy, P. Prałat: k-regular subgraphs near the k-core threshold of a random graph. Journal of Comb. Theory Series B, 142 (2020), 106-143.
• K. Leckey, D. Mitsche, N. Wormald: The height of depth-weighted random recursive trees. Random Structures and Algorithms, 56(3) (2020), 851-866.
• C. McDiarmid, D. Mitsche, P. Prałat: Clique colourings of binomial random graphs. Random Structures and Algorithms, 54(4) (2019), 589-614.
• M. Kiwi, D. Mitsche: On the second largest component of random hyperbolic graphs. SIAM J. Discrete Math. 33(4) (2019), 2200-2217.
• N. Fraiman, D. Mitsche: The diameter of inhomogeneous random graphs. Random Structures and Algorithms 53(2) (2018), 308-326.
• M. Kiwi, D. Mitsche: Spectral Gap of Random Hyperbolic Graphs and Related Parameters. Annals of Applied Probability 28(2) (2018), 941-989.
• J. Barré, M. Lelarge, D. Mitsche: On rigidity, orientability and cores of random graphs with sliders. Random Structures and Algorithms 52(3) (2018), 419-453.
• C. McDiarmid, D. Mitsche, P. Prałat: Clique colourings of geometric graphs. Electronic Journal of Combinatorics 25(4) (2018), P4.56.
• D. Mitsche, P. Prałat, E. Roshanbin: Burning number of graph products. Theoretical Computer Science 746 (2018), 124-135.
• D. Mitsche, G. Perarnau: On the treewidth and related parameters of Random Geometric Graphs. SIAM Journal on Discrete Mathematics, 31(2) (2017), 1328-1354.
• D. Mitsche, X. Pérez-Giménez, P. Prałat: Strong-majority bootstrap percolation on regular graphs with low dissemination threshold. Stochastic Processes and their Applications, 127(9) (2017), 3110-3134.
• E. Infeld, D. Mitsche, P. Prałat: The Total Acquisition Number of Random Geometric Graphs. Electronic Journal of Combinatorics, 24(3), (2017), P3.31.
• D. Mitsche, P. Prałat, E. Roshanbin: Burning graphs -- a probabilistic perspective. Graphs and Combinatorics, 33(2) (2017), 449-471.
• O. Giménez, D. Mitsche, M. Noy: Maximum degree in minor-closed classes of graphs. European Journal of Combinatorics, 55 (2016), 41-61.
• A. Dudek, D. Mitsche, P. Prałat: The set chromatic number of random graphs. Discrete Applied Mathematics 215 (2016), 61-70.
• J. Díaz, D. Mitsche, G. Perarnau, X. Pérez-Giménez: On the relation between graph distance and Euclidean distance in random geometric graphs. Advances in Applied Probability 48(3) (2016), 848-864.
• D. Mitsche, X. Pérez-Giménez, P. Prałat: The bondage number of random graphs. Electronic Journal of Combinatorics, 23(2) (2016), P2.13.
• A. Bonato, D. Mitsche, X. Pérez-Giménez, P. Prałat: A probabilistic version of the game of Zombies and Survivors on graphs. Theoretical Computer Science, 655 (2016), 2-14.
• A. Henry, D. Mitsche, P. Prałat: Homophily, influence and the decay of segregation in self-organizing networks. Network Science, 4(1) (2016), 81-116.
• S. Zejnilovic, D. Mitsche, J. Gomes, B. Sinopoli: Extending the metric dimension to graphs with missing edges. Theoretical Computer Science, 609 (2016), 384-394.
• A. Frieze, D. Mitsche, X. Pérez-Giménez, P. Prałat: On-line list coloring of random graphs. Electronic Journal of Combinatorics, 22 (2) (2015), P2.41.
• A. Kehagias, D. Mitsche, P. Prałat: The role of visibility in pursuit/evasion games. Robotics 4 (2014), 371-399.
• D. Mitsche, J. Rué: On the limiting distribution of the metric dimension for random forests. European Journal of Combinatorics, 49 (2015), 68-89.
Corrigendum European Journal of Combinatorics, 67 (2018), 275-277.
• D. Mitsche, P. Prałat: On the hyperbolicity of random graphs. Electronic Journal of Combinatorics, 21 (2) (2014), P2.39.
• A. Bonato, D. F. Gleich, M. Kim, D. Mitsche, P. Prałat, A. Tian, S. Young: Dimensionality of social networks using motifs and eigenvalues.PLOS One 9 (9) 2014, e106052. (supplement)
• A. Bonato, J. Brown, D. Mitsche, P. Prałat: Independence densities of hypergraphs. European Journal of Combinatorics, 40 (2014), 124-136.
• D. Mitsche, G. Resta, P. Santi: The Random Waypoint Mobility Model with Uniform Node Spatial Distribution. Wireless Networks, 20 (5) (2014), 1053-1066.
• B. Bollobás, D. Mitsche, P. Prałat: Metric dimension for random graphs. Electronic Journal of Combinatorics, 20 (4) (2013), P1.
• W. Kinnersley, D. Mitsche, P. Prałat: A note on the acquaintance time of random graphs. Electronic Journal of Combinatorics, 20 (3) (2013), P52.
• A. Mehrabian, D. Mitsche, P. Prałat: On the Maximum Density of Graphs with Unique-Path Labellings. SIAM Journal on Discrete Mathematics 27 (2013), 1228-1233.
• L. Barrière, C. Huemer, D. Mitsche, D. Orden: On the Fiedler value of large planar graphs. Linear Algebra and its Applications 439 (2013), 2070-2084.
• A. Bonato, D. Mitsche, P. Prałat: Vertex-pursuit in random directed acyclic graphs. SIAM Journal on Discrete Mathematics 27 (2013), 732-756.
• D. Mitsche, P. Prałat: Revolutionaries and spies on random graphs. Combinatorics, Probability and Computing 22 (2013), 417-432.
• A. Kehagias, D. Mitsche, P. Prałat: Cops and Invisible Robbers: The Cost of Drunkenness. Theoretical Computer Science 481 (2013), 100-120.
• C. Àlvarez, J. Díaz, D. Mitsche, M. Serna: Continuous Monitoring in the Dynamic Sensor Field Model. Theoretical Computer Science, 463 (2012), 114-122.
• D. Mitsche, M. Saumell, R. I. Silveira: On the Number of Higher Order Delaunay Triangulations. Theoretical Computer Science, 412 (29) (2011), 3589-3597.
• R. Berke, D. Mitsche: Colorings at Minimum Cost. Discrete Mathematics, 310:3 (2010), 561-569.
• J. Díaz, D. Mitsche, X. Pérez-Giménez: On the probability of the existence of fixed-size components in random geometric graphs. Advances in Applied Probability 41.2 (2009), 344-357.
• J. Díaz, D. Mitsche, X. Pérez-Giménez: Large connectivity for dynamic random geometric graphs. IEEE Transactions on Mobile Computing 8 (6) (2009), 821-835.
• J. Díaz, L. Kirousis, D. Mitsche, X. Pérez-Giménez: On the satisfiability threshold of formulas with three literals per clause. Theoretical Comupter Science 410 (30-32) (2009), 2920-2934.
• J. Díaz, D. Mitsche, X. Pérez-Giménez: Sharp Threshold for Hamiltonicity of Random Geometric Graphs. SIAM Journal on Discrete Mathematics 21 (1) (2007), 1157-1165.
• M. Marciniszyn, D. Mitsche, M. Stojaković: Online balanced graph avoidance games. European Journal of Combinatorics 28 (8) (2006), 2248-2263.

Publications in Refereed Conferences

• R. Fabila-Monroy, C. Hidalgo-Toscano, C. Huemer, D. Lara, D. Mitsche: Optimal Grid Drawings of Complete Multipartite Graphs and and Integer Variant of the Algebraic Connectivity. 26th International Symposium on Graph Drawing and Network Visualization (GD) 2018.
• D. Josselin, V. Labatut, D. Mitsche: Straightness of rectilinear vs. radio-concentric networks: modeling simulation and comparison. Symposium on Simulation for Architecture and Urban Design (SimAUD) 2016.
• A. Bonato, M. Lozier, D. Mitsche, X. Pérez-Giménez, P. Prałat: The domination number of on-line social networks and random geometric graphs. TAMC 2015, p. 150-163.
• M. Kiwi, D. Mitsche: A bound for the diameter of random hyperbolic graphs. ANALCO 2015, p. 26-39.
• A. Bonato, S. Finbow, P. Gordinowicz, A. Haidar, W. Kinnersley, D. Mitsche, P. Prałat, L. Stacho: The robber strikes back. Proceedings of the International Conference on Computational Intelligence, Cyber Security and Computational Models (ICC3), 3-12.
• D. Mitsche, G. Saad, J. Saia: The Power of Mediation in an Extended El Farol Game. SAGT 2013, 50-61.
• (*) A. Bonato, D. Mitsche, P. Prałat: Vertex-pursuit in hierarchical social networks. Proceedings of the 9th annual conference on Theory and Applications of Models of Computation, TAMC 2012, 50-60.
• (*) D. Mitsche, G. Perarnau: On the treewidth and related parameters of Random Geometric Graphs. STACS 2012, 408-419.
• J. Díaz, D. Mitsche, A. Marchetti-Spaccamela, P. Santi, J. Stefa: Social-Aware Forwarding Improves Routing Performance in Pocket Switched Networks. ESA 2011, 723-735.
• (*) C. Àlvarez, J. Díaz, D. Mitsche, M. Serna: Continuous Monitoring in the Dynamic Sensor Field Model. ALGOSENSORS 2011, 161-172.
• (*) L. Barrière, C. Huemer, D. Mitsche, D. Orden: On the Fiedler value of large planar graphs. EUROCOMB 2011, 111-116.
• (*) D. Mitsche, M. Saumell, R. I. Silveira: On the Number of Higher Order Delaunay Triangulations. CIAC 2010, 217-228.
• J. Díaz, D. Mitsche, N. Rustagi, J. Saia: On the power of mediators. WINE 2009, 455-462.
• (*) J. Díaz, L. Kirousis, D. Mitsche, X. Pérez-Giménez: A new upper bound for 3- SAT. FSTTCS 2008, 163-174.
• (*) J. Díaz, D. Mitsche, X. Pérez-Giménez: On the connectivity of dynamic random geometric graphs. SODA 2008, 601-610.
• J. Giesen, D. Mitsche, E. Schuberth: Collaborative Ranking: An aggregation algorithm for individuals preference estimation. AAIM 2007, 58-67.
• J. Giesen, D. Mitsche, E. Schuberth: A spectral approach to collaborative ranking. AIPREF 2007, 47-52.
• (*) M. Marciniszyn, D. Mitsche, M. Stojaković: Balanced avoidance games on random graphs. EUROCOMB 2005, 329-334.
• J. Giesen, D. Mitsche: Boosting Spectral Partitioning by Sampling and Iteration. ISAAC 2005, 473-482.
• J. Giesen, D. Mitsche: Reconstructing Many Partitions Using Spectral Techniques. FCT 2005, 433-444.
• J. Giesen, D. Mitsche: Bounding the Misclassification Error in Spectral Partitioning in the Planted Partition Model. WG 2005, 409-420.
• U. Adamy, T. Erlebach, D. Mitsche, I. Schurr, B. Speckmann, E. Welzl: Off- Line Admission Control for Advance Reservations in Star Networks. WAOA 2004, 211-224.
• J. Eder, C. Koncilia, D. Mitsche: Analysing Slices of Data Warehouses to Detect Structural Modifications. CAISE 2004, 492-505.

Other publications

• D. Josselin, S. Chekir, A. Pasquet, V. Labatut, Y. Capowiez, C. Mazzia, Y. Hayel, A. Lammoglia, C. Genre-Grandpierre, D. Mitsche, F. Patras: Modélisation, simulation et analyse de propriétés de réseaux orbitèles. Revue internationale de géomatique, 2015, 25(4), 515–536.
• Book chapter: J. Díaz, D. Mitsche, P. Santi: Theoretical Aspects of Graph Models for MANETs. In: Theoretical Aspects of Distributed Computing in Sensor Networks, Nikoletseas, S., Rolim, J. D.F. (Eds.), Springer 2011, 161-190.
• J. Díaz, D. Mitsche: The cook-book approach to the differential equation method. In: Computer Science Review, J. Díaz, J. Nesetril (Eds.), Volume 4, Issue 3, August 2010, 129-151.
• Book review: Introduction to clustering large and high-dimensional data by Jacob Kogan. In: Computer Science Review, J. Díaz, J. Nesetril (Eds.), Volume 2, 1, April 2008.

Member of Program Committee

• WAW 2019
• WAW 2018
• WAW 2017
• WAW 2016
• Discrete Mathematics Days Barcelona 2016
• WAW 2014
• MICAI 2011, MICAI 2012, MICAI 2013, MICAI 2014
• CRM Conference on Applications of Graph Spectra 2012
• CIAC 2010

Thesis

• 2016, Habilitation à diriger des recherches, Univ. Nice. Aspects of random graphs
• 2007, PhD defense, ETH Zürich. Spectral Methods on Reconstruction Problems