Sándor Kisfaludi-Bak

From MaRDI portal
Person:1693323

Available identifiers

zbMath Open kisfaludi-bak.sandorMaRDI QIDQ1693323

List of research outcomes

PublicationDate of PublicationType
https://portal.mardi4nfdi.de/entity/Q61475192024-01-15Paper
https://portal.mardi4nfdi.de/entity/Q61821482023-12-20Paper
Euclidean TSP in narrow strips2023-11-02Paper
https://portal.mardi4nfdi.de/entity/Q60600062023-11-02Paper
An ETH-Tight Exact Algorithm for Euclidean TSP2023-06-09Paper
Clique-based separators for geometric intersection graphs2023-06-05Paper
Computing list homomorphisms in geometric intersection graphs2023-05-05Paper
How Does Object Fatness Impact the Complexity of Packing in d Dimensions2023-02-03Paper
On one-round discrete voronoi games2023-02-03Paper
Lower Bounds for Dominating Set in Ball Graphs and for Weighted Dominating Set in Unit-Ball Graphs2022-10-19Paper
Online search for a hyperplane in high-dimensional Euclidean space2022-06-03Paper
https://portal.mardi4nfdi.de/entity/Q50776432022-05-18Paper
On Geometric Set Cover for Orthants2022-05-11Paper
Nearly ETH-tight Algorithms for Planar Steiner Tree with Terminals on Few Faces2021-05-03Paper
Hyperbolic intersection graphs and (quasi)-polynomial time2021-02-02Paper
A Framework for Exponential-Time-Hypothesis--Tight Algorithms and Lower Bounds in Geometric Intersection Graphs2021-01-13Paper
The Dominating Set Problem in Geometric Intersection Graphs2020-05-27Paper
Nearly ETH-tight Algorithms for Planar Steiner Tree with Terminals on Few Faces2019-10-15Paper
A framework for ETH-tight algorithms and lower bounds in geometric intersection graphs2019-08-22Paper
The homogeneous broadcast problem in narrow and wide strips. I: Algorithms2019-05-21Paper
The homogeneous broadcast problem in narrow and wide strips. II: Lower bounds2019-05-21Paper
The complexity of dominating set in geometric intersection graphs2019-04-23Paper
On the number of touching pairs in a set of planar curves2018-02-12Paper
The homogeneous broadcast problem in narrow and wide strips2017-09-22Paper
On the Exact Complexity of Hamiltonian Cycle and q-Colouring in Disk Graphs2017-07-21Paper
5 Colorable Visibility Graphs Have Bounded Size or 4 Collinear Points2014-10-27Paper
Notes on dual-critical graphs2014-10-07Paper

Research outcomes over time


Doctoral students

No records found.


Known relations from the MaRDI Knowledge Graph

PropertyValue
MaRDI profile typeMaRDI person profile
instance ofhuman


This page was built for person: Sándor Kisfaludi-Bak