Tamás Róbert Mezei

Algorithms, July, 2023

Constructing and sampling partite, 3-uniform hypergraphs with given degree sequence.

[BibT_eX]

[DOI]

CoRR, 2023

On the Small Quasi-kernel conjecture.

[BibT_eX]

[DOI]

CoRR, 2023

Covering simple orthogonal polygons with r-stars.

[BibT_eX]

[DOI]

CoRR, 2023

2022

The mixing time of switch Markov chains: A unified approach.

[BibT_eX]

[DOI]

Catherine S. Greenhill

Eur. J. Comb., 2022

Minimizing interference-to-signal ratios in multi-cell networks.

[BibT_eX]

[DOI]

CoRR, 2022

Approximate Sampling of Graphs with Near-P-stable Degree Intervals.

[BibT_eX]

[DOI]

István Miklós

CoRR, 2022

2021

Rooted NNI moves and distance-1 tail moves on tree-based phylogenetic networks.

[BibT_eX]

[DOI]

Andrew R. Francis

Discret. Appl. Math., 2021

Algorithms for Interference Minimization in Future Wireless Network Decomposition.

[BibT_eX]

[DOI]

CoRR, 2021

Half-Graphs, Other Non-stable Degree Sequences, and the Switch Markov Chain.

[BibT_eX]

[DOI]

Electron. J. Comb., 2021

2020

Complexity of Two-dimensional Bootstrap Percolation Difficulty: Algorithm and NP-Hardness.

[BibT_eX]

[DOI]

Ivailo Hartarsky

SIAM J. Discret. Math., 2020

2019

Terminal-pairability in complete bipartite graphs with non-bipartite demands: Edge-disjoint paths in complete bipartite graphs.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2019

Mobile versus Point Guards.

[BibT_eX]

[DOI]

Discret. Comput. Geom., 2019

A non-P-stable class of degree sequences for which the swap Markov chain is rapidly mixing.

[BibT_eX]

[DOI]

CoRR, 2019

The mixing time of the swap (switch) Markov chains: a unified approach.

[BibT_eX]

[DOI]

Catherine S. Greenhill

CoRR, 2019

2018

Terminal-pairability in complete bipartite graphs.

[BibT_eX]

[DOI]

Discret. Appl. Math., 2018

Computing the Difficulty of Critical Bootstrap Percolation Models is NP-hard.

[BibT_eX]

[DOI]

Ivailo Hartarsky

CoRR, 2018

2017

Note on terminal-pairability in complete grid graphs.

[BibT_eX]

[DOI]

Gábor Mészáros

Discret. Math., 2017

Extremal solutions to some art gallery and terminal-pairability problems.

[BibT_eX]

[DOI]

CoRR, 2017

Mobile vs. point guards.

[BibT_eX]

[DOI]

CoRR, 2017

2016

Partitioning orthogonal polygons into ≤ 8-vertex pieces, with application to an art gallery theorem.

[BibT_eX]

[DOI]

Comput. Geom., 2016

2015

Partitioning orthogonal polygons into at most 8-vertex pieces, with application to an art gallery theorem.

[BibT_eX]

[DOI]