Robert Šámal

Charles University — Czech Republic

Computer Science · Physical Sciences

11h-index474citations106works0.32yr avg
OpenAlex↗ORCID↗Google Scholar↗Lab page↗

Accepting Students?

No reports yet. Know if this professor is taking students?

Research Topics

Advanced Graph Theory Research(69), Limits and Structures in Graph Theory(36), Complexity and Algorithms in Graphs(23), Computational Geometry and Mesh Generation(17), Graph theory and applications(15)

Publications106 total

On the Time Complexity of Finding a Well-Spread Perfect Matching in Bridgeless Cubic Graphs
Lecture notes in computer science·2026
Nowhere-zero 8-flows in 3-edge-connected signed graphs
ArXiv.org·2025Open Access
Nowhere-zero 8-flows in 3-edge-connected signed graphs
arXiv (Cornell University)·2025Open Access
Precoloring extension in planar near-Eulerian-triangulations
European Journal of Combinatorics·2025Open Access
Precoloring extension in planar near-Eulerian-triangulations
European Journal of Combinatorics·2025Open Access
On the time complexity of finding a well-spread perfect matching in bridgeless cubic graphs
arXiv (Cornell University)·2025Open Access
Flow-critical graphs
arXiv (Cornell University)·2025Open Access
Structure of Betweenness Uniform Graphs with Low Values of Betweenness Centrality
SSRN Electronic Journal·2025Open Access
Counting circuit double covers
Journal of Graph Theory·2024Open Access
Colouring negative exact-distance graphs of signed graphs
arXiv (Cornell University)·2024Open Access
Approximate Cycle Double Cover
Lecture notes in computer science·2024· 1 cited
Random Embeddings of Graphs: The Expected Number of Faces in Most Graphs is Logarithmic
Society for Industrial and Applied Mathematics eBooks·2024· 2 cited
Structure of betweenness uniform graphs with low values of betweenness centrality
arXiv (Cornell University)·2023Open Access
Precoloring extension in planar near-Eulerian-triangulations
arXiv (Cornell University)·2023Open Access
Improved Bounds for the Binary Paint Shop Problem
Lecture notes in computer science·2023
Decomposing a triangle-free planar graph into a forest and a subcubic forest
European Journal of Combinatorics·2023· 7 citedOpen Access
Nowhere-zero 8-flows in cyclically 5-edge-connected, flow-admissible signed graphs
arXiv (Cornell University)·2023Open Access
Counting Circuit Double Covers
arXiv (Cornell University)·2023Open Access
Bounds on Functionality and Symmetric Difference -- Two Intriguing Graph Parameters
arXiv (Cornell University)·2023Open Access
Bounds on Functionality and Symmetric Difference – Two Intriguing Graph Parameters
Lecture notes in computer science·2023· 1 cited
page 1 of 6Next →

Frequent Co-authors

Bojan Mohar(16), Matt DeVos(12), David E. Roberson(6), Simone Severini(4), Antonios Varvitsiotis(4), Chris Godsil(4), Daniel Král͏̌(4), Zdenĕk Dvořák(3), Luis Goddyn(3), Jaroslav Nešetřil(3), Jiřı́ Matoušek(3), Pavel Podbrdský(3), Albert Atserias(2), Laura Mančinska(2), Amanda Montejano(2), Sebastián González Hermosillo de la Maza(2), Ron Aharoni(2), Radek Hušek(2), Lucie Mohelníková(2), Jesse Campion Loth(2)