The following pages link to Tobias Müller (Q394281):
Displaying 50 items.
- A counterexample to a conjecture of Grünbaum on piercing convex sets in the plane (Q394282) (← links)
- Sphere and dot product representations of graphs (Q411410) (← links)
- On the largest component of a hyperbolic model of complex networks (Q490412) (← links)
- Hamilton cycles in random geometric graphs (Q549867) (← links)
- Graphs with four boundary vertices (Q625373) (← links)
- Frugal, acyclic and star colourings of graphs (Q643020) (← links)
- Dot product representations of planar graphs (Q648410) (← links)
- On the chromatic number of random geometric graphs (Q663092) (← links)
- Arrangements of pseudocircles and circles (Q741610) (← links)
- A geometric Achlioptas process (Q894807) (← links)
- Lower bounding the boundary of a graph in terms of its maximum or minimum degree (Q998400) (← links)
- Circular choosability is rational (Q1026015) (← links)
- Conditioning of random conic systems under a general family of input distributions (Q1029212) (← links)
- A local limit theorem for the critical random graph (Q1038943) (← links)
- (Q1282759) (redirect page) (← links)
- Dynamic poroelasticity of thinly layered structures (Q1282760) (← links)
- Global constraints for round robin tournament scheduling. (Q1417492) (← links)
- A probabilistic model of cell size reduction in \textit{Pseudo-nitzschia delicatissima} (Bacillariophyta) (Q1620825) (← links)
- Logical limit laws for minor-closed classes of graphs (Q1745738) (← links)
- Law of large numbers for the largest component in a hyperbolic model of complex networks (Q1751976) (← links)
- The first order convergence law fails for random perfect graphs (Q1792064) (← links)
- Integer realizations of disk and segment graphs (Q1932476) (← links)
- Clustering in a hyperbolic model of complex networks (Q2042742) (← links)
- Disciplining expectations and the forward guidance puzzle (Q2136945) (← links)
- Optimisation of HMM topologies enhances DNA and protein sequence modelling (Q2254432) (← links)
- Generalised Mycielski graphs and the Borsuk-Ulam theorem (Q2327221) (← links)
- On \(r\)-dynamic coloring of grids (Q2345621) (← links)
- The acquaintance time of (percolated) random geometric graphs (Q2346592) (← links)
- Two-point concentration in random geometric graphs (Q2390151) (← links)
- Improper colouring of (random) unit disk graphs (Q2476286) (← links)
- The number of disk graphs (Q2509768) (← links)
- Optimal Cheeger cuts and bisections of random geometric graphs (Q2657914) (← links)
- (Q2767077) (← links)
- The probability of connectivity in a hyperbolic model of complex networks (Q2818276) (← links)
- Acyclic edge-colouring of planar graphs. Extended abstract (Q2851497) (← links)
- (Q2857418) (← links)
- A threshold for the Maker-Breaker clique game (Q2925528) (← links)
- (Q2941401) (← links)
- The Number of Bits Needed to Represent a Unit Disk Graph (Q3057635) (← links)
- Dot Product Representations of Planar Graphs (Q3073680) (← links)
- Acyclic Edge-Coloring of Planar Graphs (Q3094922) (← links)
- Disjoint Hamilton cycles in the random geometric graph (Q3106267) (← links)
- Cops and Robbers on Geometric Graphs (Q3168443) (← links)
- Identifying and Locating–Dominating Codes in (Random) Geometric Networks (Q3557518) (← links)
- (Q3576649) (← links)
- (Q3576687) (← links)
- Induced Matchings in Subcubic Planar Graphs (Q3586388) (← links)
- Circular choosability (Q3652533) (← links)
- On the Power of Profiles for Transcription Factor Binding Site Detection (Q4459290) (← links)
- (Q4473035) (← links)
