Sándor Kisfaludi-Bak
  • Phone+358 50 5205997
20142024

Research activity per year

If you made any changes in Pure these will be visible here soon.

Personal profile

Artistic and research interests

I am an assistant professor in the Theoretical Computer Science group (TCS) at Aalto University. I create and analyse algorithms that deal with geometric content, such as points, curves, or shapes, as well as porblems involving spatial networks. My field, computational geometry, is the theoretical basis for several areas, including computer graphics and vision, robot motion planning, computer aided design and manufacturing. I aim to discover many ways of using geometric structure to our advantage when designing algorithms.

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.
  • 1 Similar Profiles
  • Euclidean TSP in Narrow Strips

    Alkema, H., de Berg, M., van der Hofstad, R. & Kisfaludi-Bak, S., 2024, (E-pub ahead of print) In: Discrete and Computational Geometry.

    Research output: Contribution to journalArticleScientificpeer-review

  • An ETH-Tight Exact Algorithm for Euclidean TSP

    de Berg, M., Bodlaender, H. L., Kisfaludi-Bak, S. & Kolay, S., 2023, In: SIAM JOURNAL ON COMPUTING. 52, 3, p. 740-760 21 p.

    Research output: Contribution to journalArticleScientificpeer-review

    Open Access
    File
    53 Downloads (Pure)
  • Clique-Based Separators for Geometric Intersection Graphs

    de Berg, M., Kisfaludi-Bak, S., Monemizadeh, M. & Theocharous, L., Jun 2023, In: Algorithmica. 85, 6, p. 1652–1678 27 p.

    Research output: Contribution to journalArticleScientificpeer-review

    Open Access
    File
    11 Downloads (Pure)
  • A Gap-ETH-Tight Approximation Scheme for Euclidean TSP

    Kisfaludi-Bak, S., Nederlof, J. & Węgrzycki, K., Feb 2022, 2021 IEEE 62nd Annual Symposium on Foundations of Computer Science (FOCS). IEEE, p. 351-362 12 p. 9719718. (Annual Symposium on Foundations of Computer Science).

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

    4 Citations (Scopus)
  • Computing List Homomorphisms in Geometric Intersection Graphs

    Kisfaludi-Bak, S., Okrasa, K. & Rzążewski, P., 2022, Graph-Theoretic Concepts in Computer Science - 48th International Workshop, WG 2022, Revised Selected Papers. Bekos, M. A. & Kaufmann, M. (eds.). Springer, p. 313-327 15 p. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); vol. 13453 LNCS).

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

    Open Access
    File
    30 Downloads (Pure)