( en | de | ru )

 

Disambiguation of "Kisfaludi-Bak, Sándor"

Author of the publication

copydeleteadd this publication to your clipboard
The Homogeneous Broadcast Problem in Narrow and Wide Strips.

, , and . WADS, volume 10389 of Lecture Notes in Computer Science, page 289-300. Springer, (2017)

Please choose a person to relate this publication to

To differ between persons with the same name, the academic degree and the title of an important publication will be displayed. You can also use the button next to the name to display some publications already assigned to the person.

Sándor Molnár

Sándor Fejér

Béla Sándor

Sándor Kádas

Sándor Roth

 

Other publications of authors with the same name

Notes on dual-critical graphs., and . CoRR, (2014)Clique-Based Separators for Geometric Intersection Graphs., , , and . ISAAC, volume 212 of LIPIcs, page 22:1-22:15. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2021)Computing Smallest Convex Intersecting Polygons., , , and . ESA, volume 244 of LIPIcs, page 9:1-9:13. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2022)The Homogeneous Broadcast Problem in Narrow and Wide Strips I: Algorithms., , and . Algorithmica, 81 (7): 2934-2962 (2019)A framework for ETH-tight algorithms and lower bounds in geometric intersection graphs., , , , and . STOC, page 574-586. ACM, (2018)Hyperbolic intersection graphs and (quasi)-polynomial time.. CoRR, (2018)A Quadtree for Hyperbolic Space., and . CoRR, (2023)Separator Theorem and Algorithms for Planar Hyperbolic Graphs., , , , and . CoRR, (2023)Computing List Homomorphisms in Geometric Intersection Graphs., , and . WG, volume 13453 of Lecture Notes in Computer Science, page 313-327. Springer, (2022)On the Approximability of the Traveling Salesman Problem with Line Neighborhoods., , , and . SWAT, volume 227 of LIPIcs, page 10:1-10:21. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2022)