The following pages link to Dieter Mitsche (Q268259):
Displayed 33 items.
- The diameter of inhomogeneous random graphs (Q4684831) (← links)
- Revolutionaries and Spies on Random Graphs (Q4921570) (← links)
- On the Power of Choice for Boolean Functions (Q5099100) (← links)
- The height of depth‐weighted random recursive trees (Q5113959) (← links)
- Learning random points from geometric graphs or orderings (Q5136918) (← links)
- A Bound for the Diameter of Random Hyperbolic Graphs (Q5194791) (← links)
- Clique coloring of binomial random graphs (Q5229333) (← links)
- On the Second Largest Component of Random Hyperbolic Graphs (Q5244122) (← links)
- Empty non-convex and convex four-gons in random point sets (Q5248389) (← links)
- On Treewidth and Related Parameters of Random Geometric Graphs (Q5270409) (← links)
- On the probability of the existence of fixed-size components in random geometric graphs (Q5320654) (← links)
- Theoretical Aspects of Graph Models for MANETs (Q5391114) (← links)
- Collaborative Ranking: An Aggregation Algorithm for Individuals’ Preference Estimation (Q5434423) (← links)
- Sharp Threshold for Hamiltonicity of Random Geometric Graphs (Q5454260) (← links)
- Fundamentals of Computation Theory (Q5492948) (← links)
- Approximation and Online Algorithms (Q5713438) (← links)
- Graph-Theoretic Concepts in Computer Science (Q5897574) (← links)
- Algorithms and Computation (Q5897880) (← links)
- On the modularity of 3‐regular random graphs and random graphs with given degree sequences (Q6052476) (← links)
- On the first and second largest components in the percolated random geometric graph (Q6072910) (← links)
- The jump of the clique chromatic number of random graphs (Q6076219) (← links)
- On the minimum bisection of random 3-regular graphs (Q6106297) (← links)
- On the Maximum Density of Graphs with Good Edge-Labellings (Q6237090) (← links)
- The robber strikes back (Q6244076) (← links)
- Optimal Grid Drawings of Complete Multipartite Graphs and an Integer Variant of the Algebraic Connectivity (Q6305869) (← links)
- Hamilton cycles and perfect matchings in the KPKVB model (Q6313087) (← links)
- A note on the independence number, domination number and related parameters of random binary search trees and random recursive trees (Q6326129) (← links)
- On the Decycling Number of $4$-regular Random Graphs (Q6335917) (← links)
- New results for the random nearest neighbor tree (Q6376307) (← links)
- Tail bounds for detection times in mobile hyperbolic graphs (Q6392410) (← links)
- Label propagation on binomial random graphs (Q6425736) (← links)
- Cluster-size decay in supercritical kernel-based spatial random graphs (Q6428101) (← links)
- Sharp threshold for embedding balanced spanning trees in random geometric graphs (Q6430776) (← links)