Dieter Mitsche

100 papers A* 1A 4B 6C 5Journal 79Unranked 4

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