We stand with Ukraine

We stand with Ukraine

Satyam Singh

Orcid: 0009-0005-0873-066X

Affiliations:

Aalto University, Department of Computer Science, Espoo, Finland
Indian Institute of Technology Bombay, Department of Computer Science and Engineering, Mumbai, India (former)
Indian Institute of Technology Delhi, Department of Mathematics, New Delhi, India (PhD 2024)

According to our database¹, Satyam Singh authored at least 18 papers between 2021 and 2026.

Collaborative distances:

Dijkstra number² of four.
Erdős number³ of three.

Timeline

Legend:

Book In proceedings Article PhD thesis Dataset Other

Links

Online presence:

On csauthors.net:

Bibliography

2026

Online Algorithms for Geometric Independent Set.

[DOI]

,

CoRR, April, 2026

Online geometric hitting set using points in Z d.

[DOI]

,

Ratnadip Mandal

,

Theor. Comput. Sci., 2026

Online dominating set and coloring for geometric intersection graphs.

[DOI]

,

Sambhav Khurana

,

Comput. Geom., 2026

Near-Linear and Parameterized Approximations for Maximum Cliques in Disk Graphs.

[DOI]

,

Pawel Gawrychowski

,

Panos Giannopoulos

,

Wolfgang Mulzer

,

,

,

Proceedings of the 20th Scandinavian Symposium on Algorithm Theory, 2026

Online Hitting Set for Axis-Aligned Squares.

[DOI]

,

,

Proceedings of the 20th Scandinavian Symposium on Algorithm Theory, 2026

Gap-ETH-Tight Algorithms for Hyperbolic TSP and Steiner Tree.

[DOI]

Sándor Kisfaludi-Bak

,

,

,

Geert van Wordragen

Proceedings of the 42nd International Symposium on Computational Geometry, 2026

2025

Online epsilon Net & Piercing Set for Geometric Concepts.

[DOI]

,

,

Proceedings of the Thirteenth International Conference on Learning Representations, 2025

Online Hitting Sets for Disks of Bounded Radii.

[DOI]

,

,

Proceedings of the 33rd Annual European Symposium on Algorithms, 2025

New Lower Bound and Algorithm for Online Geometric Hitting Set Problem.

[DOI]

,

Ratnadip Mandal

,

Proceedings of the Computing and Combinatorics, 2025

2024

Online Geometric Covering and Piercing.

[DOI]

,

,

Sarat Varma Kallepalli

,

Algorithmica, September, 2024

Online hitting of unit balls and hypercubes in Rd using points from Zd.

[DOI]

,

Theor. Comput. Sci., 2024

Online Epsilon Net and Piercing Set for Geometric Concepts.

[DOI]

,

,

CoRR, 2024

New Lower Bound and Algorithms for Online Geometric Hitting Set Problem.

[DOI]

,

Ratnadip Mandal

,

CoRR, 2024

2023

Online Hitting of Unit Balls and Hypercubes in ℝ<sup>s</sup> using Points from ℤ<sup>d</sup>.

[DOI]

,

CoRR, 2023

Online Dominating Set and Coloring.

[DOI]

,

Sambhav Khurana

,

Proceedings of the Combinatorial Optimization and Applications, 2023

2022

Online Piercing of Geometric Objects.

[DOI]

,

,

Sarat Varma Kallepalli

,

Proceedings of the 42nd IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science, 2022

Hitting Geometric Objects Online via Points in $\mathbb {Z}^d$.

[DOI]

,

Proceedings of the Computing and Combinatorics - 28th International Conference, 2022

2021

Online Dominating Set and Independent Set.

[DOI]

,

Sambhav Khurana

,

CoRR, 2021

Loading...