Sujoy Bhore

Follow

Generating author description...

All published works
Action Title Year Authors
+ PDF Chat Spanners in Planar Domains via Steiner Spanners and non-Steiner Tree Covers 2025 Sujoy Bhore
Balázs Keszegh
Andrey Kupavskii
Hung Le
Alexandre Louvet
Dömötör Pálvölgyi
Csaba D. Tóth
+ PDF Chat Fast Static and Dynamic Approximation Algorithms for Geometric Optimization Problems: Piercing, Independent Set, Vertex Cover, and Matching 2025 Sujoy Bhore
Timothy M. Chan
+ PDF Chat Online Epsilon Net and Piercing Set for Geometric Concepts 2024 Sujoy Bhore
Dipak K. Dey
Satyam Singh
+ PDF Chat Online Euclidean Spanners 2024 Sujoy Bhore
Csaba D. Tóth
+ PDF Chat Fast Static and Dynamic Approximation Algorithms for Geometric Optimization Problems: Piercing, Independent Set, Vertex Cover, and Matching 2024 Sujoy Bhore
Timothy M. Chan
+ PDF Chat Dynamic Euclidean Bottleneck Matching 2024 A. Karim Abu-Affash
Sujoy Bhore
Paz Carmi
+ PDF Chat Geometric Bipartite Matching is in NC 2024 Sujoy Bhore
Sarfaraz Equbal
Rohit Gurjar
+ PDF Chat Spanners in Planar Domains via Steiner Spanners and non-Steiner Tree Covers 2024 Sujoy Bhore
Balázs Keszegh
Andrey Kupavskii
Hung Le
Alexandre Louvet
Dömötör Pálvölgyi
Csaba D. Tóth
+ PDF Chat Approximation Schemes for Geometric Knapsack for Packing Spheres and Fat Objects 2024 Pritam Acharya
Sujoy Bhore
Aaryan Gupta
Arindam Khan
Bratin Mondal
Andreas Wiese
+ PDF Chat Online Spanners in Metric Spaces 2024 Sujoy Bhore
Arnold Filtser
Hadi Khodabandeh
Csaba D. Tóth
+ PDF Chat Fully Dynamic Geometric Vertex Cover and Matching 2024 Sujoy Bhore
Timothy M. Chan
+ PDF Chat Online Duet between Metric Embeddings and Minimum-Weight Perfect Matchings 2024 Sujoy Bhore
Arnold Filtser
Csaba D. Tóth
+ PDF Chat Worbel: Aggregating Point Labels into Word Clouds 2023 Sujoy Bhore
Robert Ganian
Guangping Li
Martin Nöllenburg
Jules Wulms
+ Extending Orthogonal Planar Graph Drawings is Fixed-Parameter Tractable 2023 Sujoy Bhore
Robert Ganian
Liana Khazaliya
Fabrizio Montecchiani
Martin Nöllenburg
+ Dynamic Euclidean Bottleneck Matching 2023 A. Karim Abu-Affash
Sujoy Bhore
Paz Carmi
+ Fully Dynamic Maximum Independent Sets of Disks in Polylogarithmic Update Time 2023 Sujoy Bhore
Martin Nöllenburg
Csaba D. Tóth
Jules Wulms
+ On Colorful Vertex and Edge Cover Problems 2023 Sayan Bandyapadhyay
Aritra Banik
Sujoy Bhore
+ Online Duet between Metric Embeddings and Minimum-Weight Perfect Matchings 2023 Sujoy Bhore
Arnold Filtser
Csaba D. Tóth
+ On the upward book thickness problem: Combinatorial and complexity results 2022 Sujoy Bhore
Giordano Da Lozzo
Fabrizio Montecchiani
Martin Nöllenburg
+ Untangling circular drawings: Algorithms and complexity 2022 Sujoy Bhore
Guangping Li
Martin Nöllenburg
Ignaz Rutter
Hsiang‐Yun Wu
+ PDF Chat Euclidean Steiner Spanners: Light and Sparse 2022 Sujoy Bhore
Csaba D. Tóth
+ PDF Chat Parameterized Study of Steiner Tree on Unit Disk Graphs 2022 Sujoy Bhore
Paz Carmi
Sudeshna Kolay
Meirav Zehavi
+ PDF Chat An Algorithmic Study of Fully Dynamic Independent Sets for Map Labeling 2022 Sujoy Bhore
Guangping Li
Martin Nöllenburg
+ PDF Chat The balanced connected subgraph problem for geometric intersection graphs 2022 Sujoy Bhore
Satyabrata Jana
Supantha Pandit
Sasanka Roy
+ Parameterized Algorithms for Queue Layouts 2022 Sujoy Bhore
Robert Ganian
Fabrizio Montecchiani
Martin Nöllenburg
+ PDF Chat The Balanced Connected Subgraph Problem for Geometric Intersection Graphs 2022 Satyabrata Jana
Sujoy Bhore
Supantha Pandit
Sasanka Roy
+ Online Spanners in Metric Spaces 2022 Sujoy Bhore
Arnold Filtser
Hadi Khodabandeh
Csaba D. Tóth
+ Euclidean Steiner Spanners: Light and Sparse 2022 Sujoy Bhore
Csaba D. Tóth
+ On Streaming Algorithms for Geometric Independent Set and Clique 2022 Sujoy Bhore
Fabian Klute
Jelle J. Oostveen
+ Minimum Link Fencing 2022 Sujoy Bhore
Fabian Klute
Maarten Löffler
Martin Nöllenburg
Soeren Terziadis
Anaïs Villedieu
+ PDF Chat On Streaming Algorithms for Geometric Independent Set and Clique 2022 Sujoy Bhore
Fabian Klute
Jelle J. Oostveen
+ PDF Chat Geometric systems of unbiased representatives 2021 Aritra Banik
Bhaswar B. Bhattacharya
Sujoy Bhore
Leonardo Martínez-Sandoval
+ Untangling Circular Drawings: Algorithms and Complexity. 2021 Sujoy Bhore
Guangping Li
Martin Nöllenburg
Ignaz Rutter
Hsiang‐Yun Wu
+ PDF Chat Worbel 2021 Sujoy Bhore
Robert Ganian
Guangping Li
Martin Nöllenburg
Jules Wulms
+ PDF Chat Geometric planar networks on bichromatic collinear points 2021 Sayan Bandyapadhyay
Aritra Banik
Sujoy Bhore
Martin Nöllenburg
+ Light Euclidean Steiner Spanners in the Plane 2021 Sujoy Bhore
Csaba D. Tóth
+ Recognition of Unit Disk Graphs for Caterpillars, Embedded Trees, and Outerplanar Graphs. 2021 Sujoy Bhore
Soeren Nickel
Martin Nöllenburg
+ PDF Chat The balanced connected subgraph problem 2021 Sujoy Bhore
Sourav Chakraborty
Satyabrata Jana
Joseph S. B. Mitchell
Supantha Pandit
Sasanka Roy
+ Space-Efficient Algorithms for Reachability in Geometric Graphs 2021 Sujoy Bhore
Rahul Jain
+ PDF Chat Balanced Independent and Dominating Sets on Colored Interval Graphs 2021 Sujoy Bhore
Jan‐Henrik Haunert
Fabian Klute
Guangping Li
Martin Nöllenburg
+ Dynamic Schnyder Woods 2021 Sujoy Bhore
Prosenjit Bose
Pilar Cano
Jean Cardinal
John Iacono
+ Online Euclidean Spanners 2021 Sujoy Bhore
Csaba D. Tóth
+ PDF Chat Unit Disk Representations of Embedded Trees, Outerplanar and Multi-legged Graphs 2021 Sujoy Bhore
Maarten Löffler
Soeren Nickel
Martin Nöllenburg
+ PDF Chat On the Upward Book Thickness Problem: Combinatorial and Complexity Results 2021 Sujoy Bhore
Giordano Da Lozzo
Fabrizio Montecchiani
Martin Nöllenburg
+ Untangling Circular Drawings: Algorithms and Complexity 2021 Sujoy Bhore
Guangping Li
Martin Nöllenburg
Ignaz Rutter
Hsiang‐Yun Wu
+ On the Upward Book Thickness Problem: Combinatorial and Complexity Results 2021 Sujoy Bhore
Giordano Da Lozzo
Fabrizio Montecchiani
Martin Nöllenburg
+ Unit Disk Representations of Embedded Trees, Outerplanar and Multi-Legged Graphs 2021 Sujoy Bhore
Maarten Löffler
Soeren Nickel
Martin Nöllenburg
+ On Euclidean Steiner $(1+\epsilon)$-Spanners 2020 Sujoy Bhore
Csaba D. Tóth
+ Parameterized Algorithms for Book Embedding Problems 2020 Sujoy Bhore
Robert Ganian
Fabrizio Montecchiani
Martin Nöllenburg
+ Balanced Independent and Dominating Sets on Colored Interval Graphs 2020 Sujoy Bhore
Jan‐Henrik Haunert
Fabian Klute
Guangping Li
Martin Nöllenburg
+ An Algorithmic Study of Fully Dynamic Independent Sets for Map Labeling 2020 Sujoy Bhore
Guangping Li
Martin Nöllenburg
+ Geometric Systems of Unbiased Representatives 2020 Aritra Banik
Bhaswar B. Bhattacharya
Sujoy Bhore
Leonardo Martínez-Sandoval
+ Geometric Systems of Unbiased Representatives 2020 Aritra Banik
Bhaswar B. Bhattacharya
Sujoy Bhore
Leonardo Martínez-Sandoval
+ PDF Chat Geometric Planar Networks on Bichromatic Points 2020 Sayan Bandyapadhyay
Aritra Banik
Sujoy Bhore
Martin Nöllenburg
+ Planar Bichromatic Bottleneck Spanning Trees 2020 A. Karim Abu-Affash
Sujoy Bhore
Paz Carmi
Joseph S. B. Mitchell
+ Dynamic Geometric Independent Set 2020 Sujoy Bhore
Jean Cardinal
John Iacono
Grigorios Koumoutsos
+ Light Euclidean Steiner Spanners in the Plane 2020 Sujoy Bhore
Csaba D. Tóth
+ PDF Chat Parameterized Algorithms for Queue Layouts 2020 Sujoy Bhore
Robert Ganian
Fabrizio Montecchiani
Martin Nöllenburg
+ Parameterized Algorithms for Queue Layouts 2020 Sujoy Bhore
Robert Ganian
Fabrizio Montecchiani
Martin Nöllenburg
+ Geometric Systems of Unbiased Representatives 2020 Aritra Banik
Bhaswar B. Bhattacharya
Sujoy Bhore
Leonardo Martínez-Sandoval
+ An Algorithmic Study of Fully Dynamic Independent Sets for Map Labeling 2020 Sujoy Bhore
Guangping Li
Martin Nöllenburg
+ Parameterized Study of Steiner Tree on Unit Disk Graphs 2020 Sujoy Bhore
Paz Carmi
Sudeshna Kolay
Meirav Zehavi
+ On Euclidean Steiner $(1+ε)$-Spanners 2020 Sujoy Bhore
Csaba D. Tóth
+ Geometric Planar Networks on Bichromatic Points 2019 Sayan Bandyapadhyay
Aritra Banik
Sujoy Bhore
Martin Nöllenburg
+ Parameterized Algorithms for Book Embedding Problems 2019 Sujoy Bhore
Robert Ganian
Fabrizio Montecchiani
Martin Nöllenburg
+ Algorithm and Hardness results on Liar's Dominating Set and $k$-tuple Dominating Set 2019 Sandip Banerjee
Sujoy Bhore
+ PDF Chat The Balanced Connected Subgraph Problem 2019 Sujoy Bhore
Sourav Chakraborty
Satyabrata Jana
Joseph S. B. Mitchell
Supantha Pandit
Sasanka Roy
+ PDF Chat Parameterized Algorithms for Book Embedding Problems 2019 Sujoy Bhore
Robert Ganian
Fabrizio Montecchiani
Martin Nöllenburg
+ PDF Chat Balanced Connected Subgraph Problem in Geometric Intersection Graphs 2019 Sujoy Bhore
Satyabrata Jana
Supantha Pandit
Sasanka Roy
+ Balanced Connected Subgraph Problem in Geometric Intersection Graphs 2019 Sujoy Bhore
Satyabrata Jana
Supantha Pandit
Sasanka Roy
+ Parameterized Algorithms for Book Embedding Problems 2019 Sujoy Bhore
Robert Ganian
Fabrizio Montecchiani
Martin Nöllenburg
+ Algorithm and Hardness results on Liar's Dominating Set and $k$-tuple Dominating Set 2019 Sandip Banerjee
Sujoy Bhore
+ The Balanced Connected Subgraph Problem 2018 Sujoy Bhore
Sourav Chakraborty
Satyabrata Jana
Joseph S. B. Mitchell
Supantha Pandit
Sasanka Roy
+ The Balanced Connected Subgraph Problem 2018 Sujoy Bhore
Sourav Chakraborty
Satyabrata Jana
Joseph S. B. Mitchell
Supantha Pandit
Sasanka Roy
+ On local structures of cubicity 2 graphs 2016 Sujoy Bhore
Dibyayan Chakraborty
Sandip Das
Sagnik Sen
+ On a special class of boxicity 2 graphs 2016 Sujoy Bhore
Dibyayan Chakraborty
Sandip Das
Sagnik Sen
+ PDF Chat On Local Structures of Cubicity 2 Graphs 2016 Sujoy Bhore
Dibyayan Chakraborty
Sandip Das
Sagnik Sen
+ Fixed Point Theorm for Mappings in Bimetric Space 2015 Ganesh Kumar Soni
Sujoy Bhore
+ PDF Chat On a Special Class of Boxicity 2 Graphs 2015 Sujoy Bhore
Dibyayan Chakraborty
Sandip Das
Sagnik Sen
+ Some problems on fixed point theory 1985 Sujoy Bhore
Common Coauthors
Commonly Cited References
Action Title Year Authors # of times referenced
+ The book thickness of a graph 1979 Frank R. Bernhart
Paul C. Kainen
9
+ Parameterized Algorithms for Book Embedding Problems 2020 Sujoy Bhore
Robert Ganian
Fabrizio Montecchiani
Martin Nöllenburg
6
+ Embedding planar graphs in four pages 1989 Mihalis Yannakakis
6
+ Geometric Spanner Networks 2007 Giri Narasimhan
Michiel Smid
6
+ PDF Chat Interval scheduling and colorful independent sets 2014 René van Bevern
Matthias Mnich
Rolf Niedermeier
Mathias Weller
5
+ PDF Chat Approximation Schemes for Maximum Weight Independent Set of Rectangles 2013 Anna Adamaszek
Andreas Wiese
5
+ PDF Chat Truly Optimal Euclidean Spanners 2019 Hung Le
Shay Solomon
5
+ PDF Chat Approximating the bottleneck plane perfect matching of a point set 2015 A. Karim Abu-Affash
Ahmad Biniaz
Paz Carmi
Anil Maheshwari
Michiel Smid
5
+ Upper and lower bounds for finding connected motifs in vertex-colored graphs 2010 Michael R. Fellows
Guillaume Fertin
Danny Hermelin
Stéphane Vialette
4
+ Dynamic algorithms for monotonic interval scheduling problem 2014 Alexander Gavruskin
Bakhadyr Khoussainov
Mikhail Kokho
Jiamou Liu
4
+ PDF Chat Graph Treewidth and Geometric Thickness Parameters 2007 Vida Dujmović
David R. Wood
4
+ The Graph Motif problem parameterized by the structure of the input graph 2016 Édouard Bonnet
Florian Sikora
4
+ PDF Chat Exploring Semi-Automatic Map Labeling 2019 Fabian Klute
Guangping Li
Raphael Löffler
Martin Nöllenburg
Manuela Schmidt
4
+ Balanced partitions of 3-colored geometric sets in the plane 2014 Sergey Bereg
Ferrán Hurtado
Mikio Kanō
Matias Korman
Dolores Lara
Carlos Seara
Rodrigo I. Silveira
Jorge Urrutia
Kevin Verbeek
4
+ The complexity landscape of decompositional parameters for ILP 2018 Robert Ganian
Sebastian Ordyniak
4
+ Dynamic set cover: improved algorithms and lower bounds 2019 Amir Abboud
Raghavendra Addanki
Fabrizio Grandoni
Debmalya Panigrahi
Barna Saha
3
+ PDF Chat Efficient Regression in Metric Spaces via Approximate Lipschitz Extension 2017 Lee-Ad Gottlieb
Aryeh Kontorovich
Robert Krauthgamer
3
+ PDF Chat Sorting Using Networks of Queues and Stacks 1972 Robert E. Tarjan
3
+ PDF Chat The Balanced Connected Subgraph Problem 2019 Sujoy Bhore
Sourav Chakraborty
Satyabrata Jana
Joseph S. B. Mitchell
Supantha Pandit
Sasanka Roy
3
+ PDF Chat Plane Bichromatic Trees of Low Degree 2017 Ahmad Biniaz
Prosenjit Bose
Anil Maheshwari
Michiel Smid
3
+ PDF Chat Dynamic Algorithms for Graph Coloring 2018 Sayan Bhattacharya
Deeparnab Chakrabarty
Monika Henzinger
Danupon Nanongkai
3
+ PDF Chat On Locality-Sensitive Orderings and Their Applications 2020 Timothy M. Chan
Sariel Har-Peled
Mitchell Jones
3
+ A Unified Framework for Light Spanners 2020 Hung Le
Shay Solomon
3
+ PDF Chat Layout of Graphs with Bounded Tree-Width 2005 Vida Dujmović
Pat Morin
David R. Wood
3
+ PDF Chat On Approximating Maximum Independent Set of Rectangles 2016 Julia Chuzhoy
Alina Ene
3
+ PDF Chat Efficient Regression in Metric Spaces via Approximate Lipschitz Extension 2013 Lee-Ad Gottlieb
Aryeh Kontorovich
Robert Krauthgamer
3
+ PDF Chat Fully Dynamic Maximal Independent Set with Polylogarithmic Update Time 2019 Soheil Behnezhad
Mahsa Derakhshan
MohammadTaghi Hajiaghayi
Clifford Stein
Madhu Sudan
3
+ PDF Chat A Faster Parameterized Algorithm for Treedepth 2014 Felix Reidl
Peter Rossmanith
Fernando Sánchez Villaamil
Somnath Sikdar
2
+ PDF Chat Untangling Polygons and Graphs 2009 Josef Cibulka
2
+ PDF Chat A Deamortization Approach for Dynamic Spanner and Dynamic Maximal Matching 2019 Aaron Bernstein
Sebastian Forster
Monika Henzinger
2
+ Untangling planar graphs from a specified vertex position—Hard cases 2011 Mihyun Kang
Oleg Pikhurko
Alexander Ravsky
Mathias Schacht
Oleg Verbitsky
2
+ Approximating the Cubicity of Trees. 2014 Jasine Babu
Manu Basavaraju
L. Sunil Chandran
Deepak Rajendraprasad
Naveen Sivadasan
2
+ None 2004 József Balogh
Pascal Ochem
András Pluhár
2
+ A matrix characterization of interval and proper interval graphs 2007 George B. Mertzios
2
+ PDF Chat A linear kernel for planar red–blue dominating set 2016 Valentin Garnero
Ignasi Sau
Dimitrios M. Thilikos
2
+ PDF Chat On a Special Class of Boxicity 2 Graphs 2015 Sujoy Bhore
Dibyayan Chakraborty
Sandip Das
Sagnik Sen
2
+ On balanced 4-holes in bichromatic point sets 2014 Sergey Bereg
José Miguel Díaz-Báñez
Ruy Fabila‐Monroy
Pablo Pérez-Lantero
A. Ramírez-Vigueras
Toshinori Sakai
Jorge Urrutia
Inmaculada Ventura
2
+ Solving the Maximum-Weight Connected Subgraph Problem to Optimality 2014 Mohammed El-Kebir
Gunnar W. Klau
2
+ PDF Chat Untangling a Polygon 2002 Pach
Gábor Tardos
2
+ PDF Chat Quadratic Kernelization for Convex Recoloring of Trees 2007 Hans L. Bodlaender
Michael R. Fellows
Michael A. Langston
Mark A. Ragan
Frances Rosamond
Mark Weyer
2
+ PDF Chat Spanning Trees in Multipartite Geometric Graphs 2017 Ahmad Biniaz
Prosenjit Bose
David Eppstein
Anil Maheshwari
Pat Morin
Michiel Smid
2
+ PDF Chat Consistent labeling of rotating maps 2016 Andreas Gemsa
Martin Nöllenburg
Ignaz Rutter
2
+ Efficient algorithms for interval graphs and circular‐arc graphs 1982 Udaiprakash I. Gupta
D. T. Lee
Joseph Y.‐T. Leung
2
+ Layered separators in minor-closed graph classes with applications 2017 Vida Dujmović
Pat Morin
David R. Wood
2
+ PDF Chat Stack and Queue Layouts of Posets 1997 Lenwood S. Heath
Sriram V. Pemmaraju
2
+ On the obfuscation complexity of planar graphs 2008 Oleg Verbitsky
2
+ Parameterized Complexity of 1-Planarity 2017 Michael J. Bannister
Sergio Cabello
David Eppstein
2
+ PDF Chat Approximation algorithms for maximum independent set of pseudo-disks 2009 Timothy M. Chan
Sariel Har-Peled
2
+ Counting the number of independent sets in chordal graphs 2007 Yoshio Okamoto
Takeaki Uno
Ryuhei Uehara
2
+ PDF Chat Covering points by disjoint boxes with outliers 2010 Hee-Kap Ahn
Sang Won Bae
Erik D. Demaine
Martin L. Demaine
Sang-Sub Kim
Matias Korman
Iris Reinbacher
Wanbin Son
2