Finding Large Planar Subgraphs and Large Subgraphs of a Given Genus. - Gruia Calinescu; Cristina G. Fernandes (COCOON, 1996)

Alphabet Independent and Dictionary Scaled Matching. - Amihood Amir; Gruia Calinescu (CPM, 1996)

A Better Approximation Algorithm for Finding Planar Subgraphs. - Gruia Calinescu; Cristina G. Fernandes; Ulrich Finkler; Howard J. Karloff (SODA, 1996)

Multicuts in Unweighted Graphs with Bounded Degree and Bounded Tree-Width. - Gruia Calinescu; Cristina G. Fernandes; Bruce A. Reed (IPCO, 1998)

An Improved Approximation Algorithm for Multiway Cut. - Gruia Calinescu; Howard J. Karloff; Yuval Rabani (STOC, 1998)

Approximation algorithms for graph-theoretic problems: planar subgraphs and multiway cut. - Gruia Calinescu (1998)

Wavelength Assignment in WDM Rings with Splitable Lightpaths. - Gruia Calinescu; Peng-Jun Wan (ISPAN, 2000)

Alphabet-Independent and Scaled Dictionary Matching. - Amihood Amir; Gruia Calinescu (J. Algorithms, 2000)

Grooming of arbitrary traffic in SONET/WDM BLSRs. - Peng-Jun Wan; Gruia Calinescu; Ophir Frieder (IEEE J. Sel. Areas Commun., 2000)

Selecting forwarding neighbors in wireless Ad Hoc networks. - Gruia Calinescu; Ion I. Mandoiu; Peng-Jun Wan; Alexander Zelikovsky (DIAL-M, 2001)

Minimum-Energy Broadcast Routing in Static Ad Hoc Wireless Networks. - Peng-Jun Wan; Gruia Calinescu; Xiang-Yang Li 001; Ophir Frieder (INFOCOM, 2001)

Traffic partition in WDM/SONET rings to minimize SONET ADMs. - Gruia Calinescu; Peng-Jun Wan (IPDPS, 2001)

Approximation algorithms for the 0-extension problem. - Gruia Calinescu; Howard J. Karloff; Yuval Rabani (SODA, 2001)

Multicuts in Unweighted Digraphs with Bounded Degree and Bounded Tree-Width. - Gruia Calinescu; Cristina G. Fernandes (Electron. Notes Discret. Math., 2001)

Symmetric Connectivity with Minimum Power Consumption in Radio Networks. - Gruia Calinescu; Ion I. Mandoiu; Alexander Zelikovsky (IFIP TCS, 2002)

Distributed Construction of Planar Spanner and Routing for Ad Hoc Wireless Networks. - Xiang-Yang Li 001; Gruia Calinescu; Peng-Jun Wan (INFOCOM, 2002)

Improved Approximation Algorithms for Resource Allocation. - Gruia Calinescu; Amit Chakrabarti; Howard J. Karloff; Yuval Rabani (IPCO, 2002)

Minimizing electronic line terminals for automatic ring protection in general WDM optical networks. - Gruia Calinescu; Ophir Frieder; Peng-Jun Wan (IEEE J. Sel. Areas Commun., 2002)

Splittable traffic partition in WDM/SONET rings to minimize SONET ADMs. - Gruia Calinescu; Peng-Jun Wan (Theor. Comput. Sci., 2002)

Minimum-Energy Broadcasting in Static Ad Hoc Wireless Networks. - Peng-Jun Wan; Gruia Calinescu; Xiang-Yang Li 001; Ophir Frieder (Wirel. Networks, 2002)

Computing 2-Hop Neighborhoods in Ad Hoc Wireless Networks. - Gruia Calinescu (ADHOC-NOW, 2003)

Range Assignment for High Connectivity in Wireless Ad Hoc Networks. - Gruia Calinescu; Peng-Jun Wan (ADHOC-NOW, 2003)

Network Lifetime and Power Assignment in ad hoc Wireless Networks. - Gruia Calinescu; Sanjiv Kapoor; Alexander Olshevsky; Alexander Zelikovsky (ESA, 2003)

Primal-dual algorithms for QoS multimedia multicast. - Gruia Calinescu; Cristina G. Fernandes; Ion I. Mandoiu; Alexander Olshevsky; K. Yang; Alexander Zelikovsky (GLOBECOM, 2003)

Power efficient range assignment in ad-hoc wireless networks. - Ernst Althaus; Gruia Calinescu; Ion I. Mandoiu; Sushil K. Prasad; N. Tchervenski; Alexander Zelikovsky (WCNC, 2003)

A New Approximation Algorithm for Finding Heavy Planar Subgraphs. - Gruia Calinescu; Cristina G. Fernandes; Howard J. Karloff; Alexander Zelikovsky (Algorithmica, 2003)

Multicuts in unweighted graphs and digraphs with bounded degree and bounded tree-width. - Gruia Calinescu; Cristina G. Fernandes; Bruce A. Reed (J. Algorithms, 2003)

Localized Delaunay Triangulation with Application in Ad Hoc Wireless Networks. - Xiang-Yang Li 001; Gruia Calinescu; Peng-Jun Wan; Yu Wang 003 (IEEE Trans. Parallel Distributed Syst., 2003)

Separating points by axis-parallel lines. - Gruia Calinescu; Adrian Dumitrescu; Peng-Jun Wan (CCCG, 2004)

Bounding the Payment of Approximate Truthful Mechanisms. - Gruia Calinescu (ISAAC, 2004)

The Polymatroid Steiner Problems. - Gruia Calinescu; Alexander Zelikovsky (ISAAC, 2004)

Power efficient monitoring management in sensor networks. - Piotr Berman; Gruia Calinescu; C. Shah; Alexander Zelikovsky (WCNC, 2004)

Bounded-hops power assignment in ad-hoc wireless networks. - Gruia Calinescu; Sanjiv Kapoor; Mohammad Sarwat (WCNC, 2004)

Minimum-power multicast routing in static ad hoc wireless networks. - Peng-Jun Wan; Gruia Calinescu; Chih-Wei Yi (IEEE/ACM Trans. Netw., 2004)

A Survey of Algorithms for Power Assignment in Wireless Ad Hoc Networks. - Gruia Calinescu; Ophir Frieder; Peng-Jun Wan (Handbook on Theoretical and Algorithmic Aspects of Sensor, Ad Hoc Wireless, and Peer-to-Peer Networks, 2005)

Energy-efficient continuous and event-driven monitoring. - Dumitru Brinza; Gruia Calinescu; Sutep Tongngam; Alexander Zelikovsky (MASS, 2005)

Analytical bounds on broadcast with hitch-hiking in wireless ad-hoc networks. - Gruia Calinescu (MASS, 2005)

Separating Points by Axis-parallel Lines. - Gruia Calinescu; Adrian Dumitrescu; Howard J. Karloff; Peng-Jun Wan (Int. J. Comput. Geom. Appl., 2005)

Erratum: Minimum-Energy Broadcast in Static Ad Hoc Wireless Networks. - Peng-Jun Wan; Gruia Calinescu; Xiang-Yang Li 001; Ophir Frieder (Wirel. Networks, 2005)

Fast Edge Colorings with Fixed Number of Colors to Minimize Imbalance. - Gruia Calinescu; Michael J. Pelsmajer (FSTTCS, 2006)

Reconfigurations in Graphs and Grids. - Gruia Calinescu; Adrian Dumitrescu; János Pach (LATIN, 2006)

Broadcast with Hitch-hiking in Wireless Ad-Hoc Networks (Invited Talk Abstract). - Gruia Calinescu (SNPD, 2006)

A fast localized algorithm for scheduling sensors. - Gruia Calinescu (J. Parallel Distributed Comput., 2006)

Range Assignment for Biconnectivity and k-Edge Connectivity in Wireless Ad Hoc Networks. - Gruia Calinescu; Peng-Jun Wan (Mob. Networks Appl., 2006)

Power Efficient Range Assignment for Symmetric Connectivity in Static Ad Hoc Wireless Networks. - Ernst Althaus; Gruia Calinescu; Ion I. Mandoiu; Sushil K. Prasad; N. Tchervenski; Alexander Zelikovsky (Wirel. Networks, 2006)

Approximation Algorithms For Multipath Setup. - Tricha Anjali; Gruia Calinescu; Sanjiv Kapoor (GLOBECOM, 2007)

Maximizing a Submodular Set Function Subject to a Matroid Constraint (Extended Abstract). - Gruia Calinescu; Chandra Chekuri; Martin Pál; Jan Vondrák (IPCO, 2007)

Compressing rectilinear pictures and minimizing access control lists. - David L. Applegate; Gruia Calinescu; David S. Johnson 001; Howard J. Karloff; Katrina Ligett; Jia Wang (SODA, 2007)

On Ring Grooming in optical networks. - Gruia Calinescu; Peng-Jun Wan (J. Comb. Optim., 2007)

A note on data structures for maintaining bipartitions. - Gruia Calinescu (J. Discrete Algorithms, 2007)

Selected Papers from the 1st ACIS International Workshop on Self-Assembling Wireless Networks. - Gruia Calinescu; Ion I. Mandoiu; Alexander Zelikovsky; Marius Zimand (J. Univers. Comput. Sci., 2007)

Maximum Planar Subgraph. - Cristina G. Fernandes; Gruia Calinescu (Handbook of Approximation Algorithms and Metaheuristics, 2007)

Monitoring schedules for randomly deployed sensor networks. - Gruia Calinescu; Robert B. Ellis (DIALM-POMC, 2008)

Interference-Aware Broadcast Scheduling in Wireless Networks. - Gruia Calinescu; Sutep Tongngam (MSN, 2008)

Relay Nodes in Wireless Sensor Networks. - Gruia Calinescu; Sutep Tongngam (WASA, 2008)

On the k-Structure Ratio in Planar and Outerplanar Graphs. - Gruia Calinescu; Cristina G. Fernandes (Discret. Math. Theor. Comput. Sci., 2008)

Multiway Cut. - Gruia Calinescu (Encyclopedia of Algorithms, 2008)

Wireless Ad Hoc Networks: Power Assignment. - Gruia Calinescu; Ophir Frieder; Peng-Jun Wan (Encyclopedia of Wireless and Mobile Communications, 2008)

Maximum Series-Parallel Subgraph. - Gruia Calinescu; Cristina G. Fernandes; Hemanshu Kaul (WG, 2009)

Disjoint bases in a polymatroid. - Gruia Calinescu; Chandra Chekuri; Jan Vondrák (Random Struct. Algorithms, 2009)

Min-Power Strong Connectivity. - Gruia Calinescu (APPROX-RANDOM, 2010)

Multipath Network Flows: Bounded Buffers and Jitter. - Tricha Anjali; Gruia Calinescu; Alexander Fortin; Sanjiv Kapoor; Nandakiran Kirubanandan; Sutep Tongngam (INFOCOM, 2010)

Sequential Dependency Computation via Geometric Data Structures. - Gruia Calinescu; Howard J. Karloff (CCCG, 2011)

Adversary Games in Secure/Reliable Network Routing. - Gruia Calinescu; Sanjiv Kapoor; Michael Quinn; Junghwan Shin (GAMENETS, 2011)

Stochastic Strategic Routing Reduces Attack Effects. - Gruia Calinescu; Sanjiv Kapoor; Kan Qiao; Junghwan Shin (GLOBECOM, 2011)

Register Loading via Linear Programming. - Gruia Calinescu; Minming Li (WADS, 2011)

Maximizing a Monotone Submodular Function Subject to a Matroid Constraint. - Gruia Calinescu; Chandra Chekuri; Martin Pál; Jan Vondrák (SIAM J. Comput., 2011)

An improved approximation algorithm for resource allocation. - Gruia Calinescu; Amit Chakrabarti; Howard J. Karloff; Yuval Rabani (ACM Trans. Algorithms, 2011)

Asymmetric topology control: Exact solutions and fast approximations. - Gruia Calinescu; Kan Qiao (INFOCOM, 2012)

Relay Placement for Two-Connectivity. - Gruia Calinescu (Networking (2), 2012)

Maximum Series-Parallel Subgraph. - Gruia Calinescu; Cristina G. Fernandes; Hemanshu Kaul; Alexander Zelikovsky (Algorithmica, 2012)

1.85 Approximation for Min-Power Strong Connectivity - Gruia Calinescu (CoRR, 2012)

Faster approximation for Symmetric Min-Power Broadcast. - Gruia Calinescu (CCCG, 2013)

Approximate Min-Power Strong Connectivity. - Gruia Calinescu (SIAM J. Discret. Math., 2013)

Minimum Power Broadcast: Fast Variants of Greedy Approximations. - Gruia Calinescu; Kan Qiao (MASS, 2014)

Improved Algorithms for Two Energy-Optimal Routing Problems in Ad-Hoc Wireless Networks. - Samuel Baugh; Gruia Calinescu; David Rincon-Cruz; Kan Qiao (BDCloud-SocialCom-SustainCom, 2016)

Energy-Aware Real-Time Task Scheduling on Local/Shared Memory Systems. - Chenchen Fu; Gruia Calinescu; Kai Wang 018; Minming Li; Chun Jason Xue (RTSS, 2016)

1.61-approximation for min-power strong connectivity with two power levels. - Gruia Calinescu (J. Comb. Optim., 2016)

Improved approximation algorithms for single-tiered relay placement. - Gruia Calinescu; Benjamin Grimmer; Satyajayant Misra; Sutep Tongngam; Guoliang Xue; Weiyi Zhang 001 (J. Comb. Optim., 2016)

Multiway Cut. - Gruia Calinescu (Encyclopedia of Algorithms, 2016)

An FPTAS of Minimizing Total Weighted Completion Time on Single Machine with Position Constraint. - Gruia Calinescu; Florian Jaehn; Minming Li; Kai Wang 018 (ISAAC, 2017)

T-joins in strongly connected hypergraphs. - Gruia Calinescu (Discret. Math. Algorithms Appl., 2017)

Maximum Planar Subgraph. - Gruia Calinescu; Cristina G. Fernandes (Handbook of Approximation Algorithms and Metaheuristics (2), 2018)

Topology Control Problems for Wireless Ad hoc Networks. - Gruia Calinescu; Errol L. Lloyd; S. S. Ravi (Handbook of Approximation Algorithms and Metaheuristics (2), 2018)

Faster Compression of Patterns to Rectangle Rule Lists. - Ian Albuquerque Raymundo Da Silva; Gruia Calinescu; Nathan De Graaf (AAIM, 2018)

Improved Approximation Algorithms for Minimum Power Covering Problems. - Gruia Calinescu; Guy Kortsarz; Zeev Nutov (WAOA, 2018)

Energy Optimal Task Scheduling with Normally-Off Local Memory and Sleep-Aware Shared Memory with Access Conflict. - Gruia Calinescu; Chenchen Fu; Minming Li; Kai Wang 018; Chun Jason Xue (IEEE Trans. Computers, 2018)

Client assignment problems for latency minimization. - Gruia Calinescu; Xiaolang Wang (J. Comb. Optim., 2019)

A new LP rounding algorithm for the active time problem. - Gruia Calinescu; Kai Wang 018 (J. Sched., 2021)

Combination Algorithms for Steiner Tree Variants. - Gruia Calinescu; Xiaolang Wang (Algorithmica, 2023)

Online Flexible Busy Time Scheduling on Heterogeneous Machines. - Gruia Calinescu; Sami Davies; Samir Khuller; Shirley Zhang 001 (ESA, 2024)

Local Optimization Algorithms for Maximum Planar Subgraph. - Gruia Calinescu; Sumedha Uniyal (ESA, 2024)

A (1/2+1/60) - Approximation algorithm for Maximum Weight Series-Parallel Subgraph. - Gruia Calinescu; Xiaolang Wang (Discret. Appl. Math., 2024)

An improved algorithm for finding maximum outerplanar subgraphs. - Gruia Calinescu; Hemanshu Kaul; Bahareh Kudarzi (Discret. Appl. Math., 2024)

Analysis of the two-for-one swap heuristic for approximating the maximum independent set in a k-polymatroid. - Adrian Calinescu; Gruia Calinescu (Oper. Res. Lett., 2025)