The following pages link to Tamás Róbert Mezei (Q340520):
Displaying 17 items.
- Partitioning orthogonal polygons into \(\leq 8\)-vertex pieces, with application to an art gallery theorem (Q340521) (← links)
- Note on terminal-pairability in complete grid graphs (Q512572) (← links)
- Terminal-pairability in complete bipartite graphs (Q1693175) (← links)
- Mobile versus point guards (Q1716007) (← links)
- Half-graphs, other non-stable degree sequences, and the switch Markov chain (Q2040004) (← links)
- The mixing time of switch Markov chains: a unified approach (Q2237855) (← links)
- Terminal-pairability in complete bipartite graphs with non-bipartite demands. Edge-disjoint paths in complete bipartite graphs (Q2419108) (← links)
- Rooted NNI moves and distance-1 tail moves on tree-based phylogenetic networks (Q2656967) (← links)
- Terminal-Pairability in Complete Graphs (Q3119338) (← links)
- Complexity of Two-dimensional Bootstrap Percolation Difficulty: Algorithm and NP-Hardness (Q5854892) (← links)
- The sequence of prime gaps is graphic (Q6191294) (← links)
- Approximate sampling of graphs with near-\(P\)-stable degree intervals (Q6192073) (← links)
- Efficiently sampling the realizations of irregular, but linearly bounded bipartite and directed degree sequences (Q6294856) (← links)
- Minimizing interference-to-signal ratios in multi-cell networks (Q6421084) (← links)
- Degree-preserving graph dynamics -- a versatile process to construct random networks (Q6505259) (← links)
- On graphic degree sequences and matching numbers (Q6505756) (← links)
- Mixing time of the swap Markov chain and \(P\)-stability (Q6621197) (← links)
