• 13 Citations
20162019
If you made any changes in Pure these will be visible here soon.

Fingerprint Dive into the research topics where Sándor Kisfaludi-Bak is active. These topic labels come from the works of this person. Together they form a unique fingerprint.

  • 3 Similar Profiles
Wireless networks Engineering & Materials Science
Broadcast Mathematics
Strip Mathematics
Geometric Graphs Mathematics
Intersection Graphs Mathematics
Communication Engineering & Materials Science
Dominating Set Mathematics
Vertex of a graph Mathematics

Network Recent external collaboration on country level. Dive into details by clicking on the dots.

Research Output 2016 2019

  • 13 Citations
  • 7 Conference contribution
  • 7 Article
  • 1 Paper
  • 1 Phd Thesis 1 (Research TU/e / Graduation TU/e)

ETH-tight algorithms for geometric network problems

Kisfaludi-Bak, S., 27 Jun 2019, Eindhoven: Technische Universiteit Eindhoven. 196 p.

Research output: ThesisPhd Thesis 1 (Research TU/e / Graduation TU/e)

Open Access
File
2 Citations (Scopus)

Nearly ETH-tight algorithms for planar Steiner Tree with terminals on few faces

Kisfaludi-Bak, S., Nederlof, J. & van Leeuwen, E. J., 2019, Proceedings of the Thirtieth Annual ACM-SIAM Symposium on Discrete Algorithms. Chan, T. M. (ed.). New York: Association for Computing Machinery, Inc, p. 1015-1034 20 p.

Research output: Chapter in Book/Report/Conference proceedingConference contributionAcademicpeer-review

Open Access
Steiner Tree
Face
Graph in graph theory
Steiner Tree Problem
K-space
1 Downloads (Pure)

On geometric set cover for orthants

Bringmann, K., Kisfaludi-Bak, S., Pilipczuk, M. & van Leeuwen, E. J., 1 Sep 2019, 27th Annual European Symposium on Algorithms, ESA 2019. Bender, M. A., Svensson, O. & Herman, G. (eds.). Dagstuhl: Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 18 p. 26. (Leibniz International Proceedings in Informatics (LIPIcs); vol. 144).

Research output: Chapter in Book/Report/Conference proceedingConference contributionAcademicpeer-review

Open Access
File
Approximation algorithms
Multiobjective optimization
Polynomials
3 Citations (Scopus)

The complexity of Dominating set in geometric intersection graphs

de Berg, M., Kisfaludi-Bak, S. & Woeginger, G., 17 May 2019, In : Theoretical Computer Science. 769, p. 18-31 14 p.

Research output: Contribution to journalArticleAcademicpeer-review

Geometric Graphs
Intersection Graphs
Dominating Set
Interval
Semi-algebraic Sets
11 Downloads (Pure)

The homogeneous broadcast problem in narrow and wide strips I: algorithms

de Berg, M., Bodlaender, H. L. & Kisfaludi-Bak, S., 1 Jul 2019, In : Algorithmica. 81, 7, p. 2934-2962 29 p.

Research output: Contribution to journalArticleAcademicpeer-review

Open Access
File
Broadcast
Strip
Wireless networks
Hardness
Polynomials