The following pages link to Dieter Mitsche (Q268259):
Displaying 50 items.
- Maximum degree in minor-closed classes of graphs (Q268260) (← links)
- The bondage number of random graphs (Q281604) (← links)
- The number of empty four-gons in random point sets (Q283694) (← links)
- The set chromatic number of random graphs (Q323038) (← links)
- A probabilistic version of the game of zombies and survivors on graphs (Q343921) (← links)
- Cops and invisible robbers: the cost of drunkenness (Q385064) (← links)
- A note on the acquaintance time of random graphs (Q396895) (← links)
- Metric dimension for random graphs (Q396907) (← links)
- Independence densities of hypergraphs (Q402469) (← links)
- On the hyperbolicity of random graphs (Q405243) (← links)
- Book review of: J. Kogan, Introduction to clustering large and high-dimensional data (Q458461) (← links)
- The cook-book approach to the differential equation method (Q465658) (← links)
- On-line list colouring of random graphs (Q491533) (← links)
- On the number of higher order Delaunay triangulations (Q551184) (← links)
- Clique colourings of geometric graphs (Q668027) (← links)
- A survey of the modified Moran process and evolutionary graph theory (Q826319) (← links)
- Colorings at minimum cost (Q960968) (← links)
- Spectral gap of random hyperbolic graphs and related parameters (Q1650095) (← links)
- Optimal grid drawings of complete multipartite graphs and an integer variant of the algebraic connectivity (Q1725794) (← links)
- Burning number of graph products (Q1784749) (← links)
- (Q1929223) (redirect page) (← links)
- Continuous monitoring in the dynamic sensor field model (Q1929224) (← links)
- Burning graphs: a probabilistic perspective (Q2014226) (← links)
- The contact process on random hyperbolic graphs: metastability and critical exponents (Q2039443) (← links)
- On the largest component of subcritical random hyperbolic graphs (Q2064858) (← links)
- Limit theory of combinatorial optimization for random geometric graphs (Q2075326) (← links)
- Localization game for random geometric graphs (Q2107488) (← links)
- A note on the independence number, domination number and related parameters of random binary search trees and random recursive trees (Q2223687) (← links)
- On the satisfiability threshold of formulas with three literals per clause (Q2271431) (← links)
- On the limiting distribution of the metric dimension for random forests (Q2349959) (← links)
- The total acquisition number of random geometric graphs (Q2401413) (← links)
- Strong-majority bootstrap percolation on regular graphs with low dissemination threshold (Q2402436) (← links)
- Corrigendum to: ``On the limiting distribution of the metric dimension for random forests'' (Q2408981) (← links)
- On the Fiedler value of large planar graphs (Q2435468) (← links)
- Online balanced graph avoidance games (Q2461779) (← links)
- On the relation between graph distance and Euclidean distance in random geometric graphs (Q2830884) (← links)
- Vertex-Pursuit in Random Directed Acyclic Graphs (Q2848534) (← links)
- The Power of Mediation in an Extended El Farol Game (Q2856131) (← links)
- (Q2857328) (← links)
- On the Maximum Density of Graphs with Unique-Path Labelings (Q2870502) (← links)
- Vertex-Pursuit in Hierarchical Social Networks (Q2898017) (← links)
- (Q2904780) (← links)
- The Domination Number of On-line Social Networks and Random Geometric Graphs (Q2948462) (← links)
- Social-Aware Forwarding Improves Routing Performance in Pocket Switched Networks (Q3092275) (← links)
- A new upper bound for 3-SAT (Q3165956) (← links)
- Between Colorings and Layouts - Minimum Morphism Cost Problems (Q3439587) (← links)
- On the Number of Higher Order Delaunay Triangulations (Q3563004) (← links)
- (Q3576713) (← links)
- (Q3579492) (← links)
- On rigidity, orientability, and cores of random graphs with sliders (Q4642742) (← links)
