Gruia Calinescu

ORCID

Publication Activity (10 Years)

Years Active: 1996-2024
Publications (10 Years): 19

Top Venues

Publications

Gruia Calinescu, Sami Davies, Samir Khuller, Shirley Zhang
Online Flexible Busy Time Scheduling on Heterogeneous Machines. CoRR (2024)
Gruia Calinescu, Hemanshu Kaul, Bahareh Kudarzi
An improved algorithm for finding maximum outerplanar subgraphs. Discret. Appl. Math. 342 (2024)
Gruia Calinescu, Xiaolang Wang
A (1/2+1/60) - Approximation algorithm for Maximum Weight Series-Parallel Subgraph. Discret. Appl. Math. 354 (2024)
Gruia Calinescu, Hemanshu Kaul, Bahareh Kudarzi
An Improved Algorithm for Finding Maximum Outerplanar Subgraphs. CoRR (2023)
Gruia Calinescu, Xiaolang Wang
Combination Algorithms for Steiner Tree Variants. Algorithmica 85 (1) (2023)
Gruia Calinescu, Kai Wang
A new LP rounding algorithm for the active time problem. J. Sched. 24 (5) (2021)
Ian Albuquerque Raymundo Da Silva, Gruia Calinescu, Nathan De Graaf
Faster compression of patterns to Rectangle Rule Lists. Theor. Comput. Sci. (2020)
Gruia Calinescu, Guy Kortsarz, Zeev Nutov
Improved approximation algorithms for minimum power covering problems. Theor. Comput. Sci. 795 (2019)
Gruia Calinescu, Xiaolang Wang
Client assignment problems for latency minimization. J. Comb. Optim. 37 (3) (2019)
Gruia Calinescu, Guy Kortsarz, Zeev Nutov
Improved Approximation Algorithms for Minimum Power Covering Problems. WAOA (2018)
Gruia Calinescu, Chenchen Fu, Minming Li, Kai Wang, Chun Jason Xue
Energy Optimal Task Scheduling with Normally-Off Local Memory and Sleep-Aware Shared Memory with Access Conflict. IEEE Trans. Computers 67 (8) (2018)
Ian Albuquerque Raymundo Da Silva, Gruia Calinescu, Nathan De Graaf
Faster Compression of Patterns to Rectangle Rule Lists. AAIM (2018)
Gruia Calinescu, Florian Jaehn, Minming Li, Kai Wang
An FPTAS of Minimizing Total Weighted Completion Time on Single Machine with Position Constraint. CoRR (2017)
Gruia Calinescu, Florian Jaehn, Minming Li, Kai Wang
An FPTAS of Minimizing Total Weighted Completion Time on Single Machine with Position Constraint. ISAAC (2017)
Gruia Calinescu
T-joins in strongly connected hypergraphs. Discret. Math. Algorithms Appl. 9 (6) (2017)
Samuel Baugh, Gruia Calinescu, David Rincon-Cruz, Kan Qiao
Improved Algorithms for Two Energy-Optimal Routing Problems in Ad-Hoc Wireless Networks. BDCloud-SocialCom-SustainCom (2016)
Gruia Calinescu, Benjamin Grimmer, Satyajayant Misra, Sutep Tongngam, Guoliang Xue, Weiyi Zhang
Improved approximation algorithms for single-tiered relay placement. J. Comb. Optim. 31 (3) (2016)
Chenchen Fu, Gruia Calinescu, Kai Wang, Minming Li, Chun Jason Xue
Energy-Aware Real-Time Task Scheduling on Local/Shared Memory Systems. RTSS (2016)
Gruia Calinescu
1.61-approximation for min-power strong connectivity with two power levels. J. Comb. Optim. 31 (1) (2016)
Gruia Calinescu, Minming Li
Register Loading via Linear Programming. Algorithmica 72 (4) (2015)
Gruia Calinescu
Bounding the payment of approximate truthful mechanisms. Theor. Comput. Sci. 562 (2015)
Gruia Calinescu, Howard J. Karloff
Sequential dependency computation via geometric data structures. Comput. Geom. 47 (2) (2014)
Gruia Calinescu, Kan Qiao
Minimum Power Broadcast: Fast Variants of Greedy Approximations. MASS (2014)
Gruia Calinescu
Relay placement for two-connectivity. Discret. Optim. 14 (2014)
Gruia Calinescu
Faster approximation for Symmetric Min-Power Broadcast. CCCG (2013)
Gruia Calinescu
Approximate Min-Power Strong Connectivity. SIAM J. Discret. Math. 27 (3) (2013)
Gruia Calinescu
1.85 Approximation for Min-Power Strong Connectivity CoRR (2012)
Gruia Calinescu, Kan Qiao
Asymmetric topology control: Exact solutions and fast approximations. INFOCOM (2012)
Gruia Calinescu, Cristina G. Fernandes, Hemanshu Kaul, Alexander Zelikovsky
Maximum Series-Parallel Subgraph. Algorithmica 63 (1-2) (2012)
Gruia Calinescu
Relay Placement for Two-Connectivity. Networking (2) (2012)
Gruia Calinescu, Sanjiv Kapoor, Michael Quinn, Junghwan Shin
Adversary Games in Secure/Reliable Network Routing. GAMENETS (2011)
Gruia Calinescu, Minming Li
Register Loading via Linear Programming. WADS (2011)
Gruia Calinescu, Sanjiv Kapoor, Kan Qiao, Junghwan Shin
Stochastic Strategic Routing Reduces Attack Effects. GLOBECOM (2011)
Gruia Calinescu, Howard J. Karloff
Sequential Dependency Computation via Geometric Data Structures. CCCG (2011)
Gruia Calinescu, Amit Chakrabarti, Howard J. Karloff, Yuval Rabani
An improved approximation algorithm for resource allocation. ACM Trans. Algorithms 7 (4) (2011)
Gruia Calinescu, Sutep Tongngam
Interference-aware broadcast scheduling in wireless networks. Ad Hoc Networks 9 (7) (2011)
Gruia Calinescu, Chandra Chekuri, Martin Pál, Jan Vondrák
Maximizing a Monotone Submodular Function Subject to a Matroid Constraint. SIAM J. Comput. 40 (6) (2011)
Gruia Calinescu
Min-Power Strong Connectivity. APPROX-RANDOM (2010)
Tricha Anjali, Gruia Calinescu, Alexander Fortin, Sanjiv Kapoor, Nandakiran Kirubanandan, Sutep Tongngam
Multipath Network Flows: Bounded Buffers and Jitter. INFOCOM (2010)
Gruia Calinescu, Chandra Chekuri, Jan Vondrák
Disjoint bases in a polymatroid. Random Struct. Algorithms 35 (4) (2009)
Gruia Calinescu, Cristina G. Fernandes, Hemanshu Kaul
Maximum Series-Parallel Subgraph. WG (2009)
Gruia Calinescu, Michael J. Pelsmajer
Fast edge colorings with fixed number of colors to minimize imbalance. J. Graph Algorithms Appl. 12 (4) (2008)
Gruia Calinescu, Sutep Tongngam
Relay Nodes in Wireless Sensor Networks. WASA (2008)
Gruia Calinescu, Sutep Tongngam
Interference-Aware Broadcast Scheduling in Wireless Networks. MSN (2008)
Gruia Calinescu, Robert B. Ellis
Monitoring schedules for randomly deployed sensor networks. DIALM-POMC (2008)
Gruia Calinescu, Adrian Dumitrescu, János Pach
Reconfigurations in Graphs and Grids. SIAM J. Discret. Math. 22 (1) (2008)
Gruia Calinescu, Cristina G. Fernandes
On the k-Structure Ratio in Planar and Outerplanar Graphs. Discret. Math. Theor. Comput. Sci. 10 (3) (2008)
Gruia Calinescu, Ion I. Mandoiu, Alexander Zelikovsky, Marius Zimand
Selected Papers from the 1st ACIS International Workshop on Self-Assembling Wireless Networks. J. Univers. Comput. Sci. 13 (1) (2007)
Gruia Calinescu, Chandra Chekuri, Martin Pál, Jan Vondrák
Maximizing a Submodular Set Function Subject to a Matroid Constraint (Extended Abstract). IPCO (2007)
Tricha Anjali, Gruia Calinescu, Sanjiv Kapoor
Approximation Algorithms For Multipath Setup. GLOBECOM (2007)
David L. Applegate, Gruia Calinescu, David S. Johnson, Howard J. Karloff, Katrina Ligett, Jia Wang
Compressing rectilinear pictures and minimizing access control lists. SODA (2007)
Gruia Calinescu
A note on data structures for maintaining bipartitions. J. Discrete Algorithms 5 (1) (2007)
Gruia Calinescu, Peng-Jun Wan
On Ring Grooming in optical networks. J. Comb. Optim. 13 (2) (2007)
Gruia Calinescu
A fast localized algorithm for scheduling sensors. J. Parallel Distributed Comput. 66 (4) (2006)
Gruia Calinescu, Sanjiv Kapoor, Mohammad Sarwat
Bounded-hops power assignment in ad hoc wireless networks. Discret. Appl. Math. 154 (9) (2006)
Gruia Calinescu, Adrian Dumitrescu, János Pach
Reconfigurations in Graphs and Grids. LATIN (2006)
Ernst Althaus, Gruia Calinescu, Ion I. Mandoiu, Sushil K. Prasad, N. Tchervenski, Alexander Zelikovsky
Power Efficient Range Assignment for Symmetric Connectivity in Static Ad Hoc Wireless Networks. Wirel. Networks 12 (3) (2006)
Gruia Calinescu, Peng-Jun Wan
-Edge Connectivity in Wireless Ad Hoc Networks. Mob. Networks Appl. 11 (2) (2006)
Gruia Calinescu, Michael J. Pelsmajer
Fast Edge Colorings with Fixed Number of Colors to Minimize Imbalance. FSTTCS (2006)
Gruia Calinescu
Broadcast with Hitch-hiking in Wireless Ad-Hoc Networks (Invited Talk Abstract). SNPD (2006)
Gruia Calinescu, Alexander Zelikovsky
The Polymatroid Steiner Problems. J. Comb. Optim. 9 (3) (2005)
Dumitru Brinza, Gruia Calinescu, Sutep Tongngam, Alexander Zelikovsky
Energy-efficient continuous and event-driven monitoring. MASS (2005)
Gruia Calinescu
Analytical bounds on broadcast with hitch-hiking in wireless ad-hoc networks. MASS (2005)
Gruia Calinescu, Adrian Dumitrescu, Howard J. Karloff, Peng-Jun Wan
Separating Points by Axis-parallel Lines. Int. J. Comput. Geom. Appl. 15 (6) (2005)
Peng-Jun Wan, Gruia Calinescu, Xiang-Yang Li, Ophir Frieder
Erratum: Minimum-Energy Broadcast in Static Ad Hoc Wireless Networks. Wirel. Networks 11 (4) (2005)
Gruia Calinescu, Adrian Dumitrescu, Peng-Jun Wan
Separating points by axis-parallel lines. CCCG (2004)
Gruia Calinescu, Ion I. Mandoiu, Peng-Jun Wan, Alexander Zelikovsky
Selecting Forwarding Neighbors in Wireless Ad Hoc Networks. Mob. Networks Appl. 9 (2) (2004)
Gruia Calinescu, Howard J. Karloff, Yuval Rabani
Approximation Algorithms for the 0-Extension Problem. SIAM J. Comput. 34 (2) (2004)
Gruia Calinescu, Sanjiv Kapoor, Mohammad Sarwat
Bounded-hops power assignment in ad-hoc wireless networks. WCNC (2004)
Piotr Berman, Gruia Calinescu, C. Shah, Alexander Zelikovsky
Power efficient monitoring management in sensor networks. WCNC (2004)
Gruia Calinescu
Bounding the Payment of Approximate Truthful Mechanisms. ISAAC (2004)
Peng-Jun Wan, Gruia Calinescu, Chih-Wei Yi
Minimum-power multicast routing in static ad hoc wireless networks. IEEE/ACM Trans. Netw. 12 (3) (2004)
Gruia Calinescu, Alexander Zelikovsky
The Polymatroid Steiner Problems. ISAAC (2004)
Gruia Calinescu, Cristina G. Fernandes, Howard J. Karloff, Alexander Zelikovsky
A New Approximation Algorithm for Finding Heavy Planar Subgraphs. Algorithmica 36 (2) (2003)
Gruia Calinescu
Computing 2-Hop Neighborhoods in Ad Hoc Wireless Networks. ADHOC-NOW (2003)
Gruia Calinescu, Sanjiv Kapoor, Alexander Olshevsky, Alexander Zelikovsky
Network Lifetime and Power Assignment in ad hoc Wireless Networks. ESA (2003)
Gruia Calinescu, Peng-Jun Wan
Range Assignment for High Connectivity in Wireless Ad Hoc Networks. ADHOC-NOW (2003)
Ernst Althaus, Gruia Calinescu, Ion I. Mandoiu, Sushil K. Prasad, N. Tchervenski, Alexander Zelikovsky
Power efficient range assignment in ad-hoc wireless networks. WCNC (2003)
Xiang-Yang Li, Gruia Calinescu, Peng-Jun Wan, Yu Wang
Localized Delaunay Triangulation with Application in Ad Hoc Wireless Networks. IEEE Trans. Parallel Distributed Syst. 14 (10) (2003)
Gruia Calinescu, Cristina G. Fernandes, Ion I. Mandoiu, Alexander Olshevsky, K. Yang, Alexander Zelikovsky
Primal-dual algorithms for QoS multimedia multicast. GLOBECOM (2003)
Gruia Calinescu, Cristina G. Fernandes, Bruce A. Reed
Multicuts in unweighted graphs and digraphs with bounded degree and bounded tree-width. J. Algorithms 48 (2) (2003)
Xiang-Yang Li, Gruia Calinescu, Peng-Jun Wan
Distributed Construction of Planar Spanner and Routing for Ad Hoc Wireless Networks. INFOCOM (2002)
Gruia Calinescu, Amit Chakrabarti, Howard J. Karloff, Yuval Rabani
Improved Approximation Algorithms for Resource Allocation. IPCO (2002)
Gruia Calinescu, Ion I. Mandoiu, Alexander Zelikovsky
Symmetric Connectivity with Minimum Power Consumption in Radio Networks. IFIP TCS (2002)
Gruia Calinescu, Peng-Jun Wan
Traffic Partition in WDM/SONET Rings to Minimize SONET ADMs. J. Comb. Optim. 6 (4) (2002)
Gruia Calinescu, Peng-Jun Wan
Splittable traffic partition in WDM/SONET rings to minimize SONET ADMs. Theor. Comput. Sci. 276 (1-2) (2002)
Gruia Calinescu, Ophir Frieder, Peng-Jun Wan
Minimizing electronic line terminals for automatic ring protection in general WDM optical networks. IEEE J. Sel. Areas Commun. 20 (1) (2002)
Peng-Jun Wan, Gruia Calinescu, Xiang-Yang Li, Ophir Frieder
Minimum-Energy Broadcasting in Static Ad Hoc Wireless Networks. Wirel. Networks 8 (6) (2002)
Gruia Calinescu, Ion I. Mandoiu, Peng-Jun Wan, Alexander Zelikovsky
Selecting forwarding neighbors in wireless Ad Hoc networks. DIAL-M (2001)
Gruia Calinescu, Howard J. Karloff, Yuval Rabani
Approximation algorithms for the 0-extension problem. SODA (2001)
Peng-Jun Wan, Gruia Calinescu, Xiang-Yang Li, Ophir Frieder
Minimum-Energy Broadcast Routing in Static Ad Hoc Wireless Networks. INFOCOM (2001)
Gruia Calinescu, Peng-Jun Wan
Traffic partition in WDM/SONET rings to minimize SONET ADMs. IPDPS (2001)
Gruia Calinescu, Cristina G. Fernandes
Multicuts in Unweighted Digraphs with Bounded Degree and Bounded Tree-Width. Electron. Notes Discret. Math. 7 (2001)
Gruia Calinescu, Peng-Jun Wan
Wavelength Assignment in WDM Rings with Splitable Lightpaths. ISPAN (2000)
Gruia Calinescu, Howard J. Karloff, Yuval Rabani
An Improved Approximation Algorithm for MULTIWAY CUT. J. Comput. Syst. Sci. 60 (3) (2000)
Peng-Jun Wan, Gruia Calinescu, Ophir Frieder
Grooming of arbitrary traffic in SONET/WDM BLSRs. IEEE J. Sel. Areas Commun. 18 (10) (2000)
Amihood Amir, Gruia Calinescu
Alphabet-Independent and Scaled Dictionary Matching. J. Algorithms 36 (1) (2000)
Gruia Calinescu, Howard J. Karloff, Yuval Rabani
An Improved Approximation Algorithm for Multiway Cut. STOC (1998)
Gruia Calinescu, Cristina G. Fernandes, Ulrich Finkler, Howard J. Karloff
A Better Approximation Algorithm for Finding Planar Subgraphs. J. Algorithms 27 (2) (1998)
Gruia Calinescu, Cristina G. Fernandes, Bruce A. Reed
Multicuts in Unweighted Graphs with Bounded Degree and Bounded Tree-Width. IPCO (1998)

Gruia Calinescu.css-eqlu8i{font-size:small;padding-left:4px;}

Publication Activity (10 Years)

Top Topics

Top Venues

Gruia Calinescu