Gruia Calinescu

Gruia Calinescu, Cristina G. Fernandes, Hemanshu Kaul, Alexander Zelikovsky: Maximum Series-Parallel Subgraph. Algorithmica 63(1-2): 137-157 (2012)

Gruia Calinescu, K. Qiao: Asymmetric topology control: Exact solutions and fast approximations. INFOCOM 2012: 783-791

Gruia Calinescu: Relay Placement for Two-Connectivity. Networking (2) 2012: 366-377

Gruia Calinescu: 1.85 Approximation for Min-Power Strong Connectivity. CoRR abs/1205.3397 (2012)

Gruia Calinescu, Sutep Tongngam: Interference-aware broadcast scheduling in wireless networks. Ad Hoc Networks 9(7): 1069-1082 (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): 1740-1766 (2011)

Gruia Calinescu, Amit Chakrabarti, Howard J. Karloff, Yuval Rabani: An improved approximation algorithm for resource allocation. ACM Transactions on Algorithms 7(4): 48 (2011)

Gruia Calinescu, Howard J. Karloff: Sequential Dependency Computation via Geometric Data Structures. CCCG 2011

Gruia Calinescu, Sanjiv Kapoor, Michael Quinn, Junghwan Shin: Adversary Games in Secure/Reliable Network Routing. GAMENETS 2011: 249-264

Gruia Calinescu, Sanjiv Kapoor, K. Qiao, Junghwan Shin: Stochastic Strategic Routing Reduces Attack Effects. GLOBECOM 2011: 1-5

Gruia Calinescu, Minming Li: Register Loading via Linear Programming. WADS 2011: 171-182

Gruia Calinescu: Min-Power Strong Connectivity. APPROX-RANDOM 2010: 67-80

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

Gruia Calinescu, Chandra Chekuri, Jan Vondrák: Disjoint bases in a polymatroid. Random Struct. Algorithms 35(4): 418-430 (2009)

Gruia Calinescu, Cristina G. Fernandes, Hemanshu Kaul: Maximum Series-Parallel Subgraph. WG 2009: 54-65

Gruia Calinescu, Cristina G. Fernandes: On the k-Structure Ratio in Planar and Outerplanar Graphs. Discrete Mathematics & Theoretical Computer Science 10(3) (2008)

Gruia Calinescu, Michael J. Pelsmajer: Fast edge colorings with fixed number of colors to minimize imbalance. J. Graph Algorithms Appl. 12(4): 401-417 (2008)

Gruia Calinescu, Adrian Dumitrescu, János Pach: Reconfigurations in Graphs and Grids. SIAM J. Discrete Math. 22(1): 124-138 (2008)

Gruia Calinescu, Sutep Tongngam: Interference-Aware Broadcast Scheduling in Wireless Networks. MSN 2008: 258-266

Gruia Calinescu, Sutep Tongngam: Relay Nodes in Wireless Sensor Networks. WASA 2008: 286-297

Gruia Calinescu: Multiway Cut. Encyclopedia of Algorithms 2008

Gruia Calinescu, Peng-Jun Wan: On Ring Grooming in optical networks. J. Comb. Optim. 13(2): 103-122 (2007)

Gruia Calinescu: A note on data structures for maintaining bipartitions. J. Discrete Algorithms 5(1): 129-134 (2007)

Gruia Calinescu, Ion I. Mandoiu, Alexander Zelikovsky, Marius Zimand: Selected Papers from the 1st ACIS International Workshop on Self-Assembling Wireless Networks. J. UCS 13(1): 1-3 (2007)

Tricha Anjali, Gruia Calinescu, Sanjiv Kapoor: Approximation Algorithms For Multipath Setup. GLOBECOM 2007: 438-442

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

David Applegate, Gruia Calinescu, David S. Johnson, Howard J. Karloff, Katrina Ligett, Jia Wang: Compressing rectilinear pictures and minimizing access control lists. SODA 2007: 1066-1075

Gruia Calinescu, Sanjiv Kapoor, Mohammad Sarwat: Bounded-hops power assignment in ad hoc wireless networks. Discrete Applied Mathematics 154(9): 1358-1371 (2006)

Gruia Calinescu: A fast localized algorithm for scheduling sensors. J. Parallel Distrib. Comput. 66(4): 507-514 (2006)

Gruia Calinescu, Peng-Jun Wan: Range Assignment for Biconnectivity and k-Edge Connectivity in Wireless Ad Hoc Networks. MONET 11(2): 121-128 (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. Wireless Networks 12(3): 287-299 (2006)

Gruia Calinescu, Michael J. Pelsmajer: Fast Edge Colorings with Fixed Number of Colors to Minimize Imbalance. FSTTCS 2006: 117-128

Gruia Calinescu, Adrian Dumitrescu, János Pach: Reconfigurations in Graphs and Grids. LATIN 2006: 262-273

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

Gruia Calinescu, Adrian Dumitrescu, Howard J. Karloff, Peng-Jun Wan: Separating Points by Axis-parallel Lines. Int. J. Comput. Geometry Appl. 15(6): 575-590 (2005)

Gruia Calinescu, Alexander Zelikovsky: The Polymatroid Steiner Problems. J. Comb. Optim. 9(3): 281-294 (2005)

Peng-Jun Wan, Gruia Calinescu, Xiang-Yang Li, Ophir Frieder: Erratum: Minimum-Energy Broadcast in Static Ad Hoc Wireless Networks. Wireless Networks 11(4): 531-533 (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, Ion I. Mandoiu, Peng-Jun Wan, Alexander Zelikovsky: Selecting Forwarding Neighbors in Wireless Ad Hoc Networks. MONET 9(2): 101-111 (2004)

Gruia Calinescu, Howard J. Karloff, Yuval Rabani: Approximation Algorithms for the 0-Extension Problem. SIAM J. Comput. 34(2): 358-372 (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): 507-514 (2004)

Gruia Calinescu, Adrian Dumitrescu, Peng-Jun Wan: Separating points by axis-parallel lines. CCCG 2004: 7-10

Gruia Calinescu: Bounding the Payment of Approximate Truthful Mechanisms. ISAAC 2004: 221-233

Gruia Calinescu, Alexander Zelikovsky: The Polymatroid Steiner Problems. ISAAC 2004: 234-245

Gruia Calinescu, Sanjiv Kapoor, Mohammad Sarwat: Bounded-hops power assignment in ad-hoc wireless networks. WCNC 2004: 1494-1499

Piotr Berman, Gruia Calinescu, C. Shah, Alexander Zelikovsky: Power efficient monitoring management in sensor networks. WCNC 2004: 2329-2334

Gruia Calinescu, Cristina G. Fernandes, Howard J. Karloff, Alexander Zelikovsky: A New Approximation Algorithm for Finding Heavy Planar Subgraphs. Algorithmica 36(2): 179-205 (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): 333-359 (2003)

Xiang-Yang Li, Gruia Calinescu, Peng-Jun Wan, Yu Wang: Localized Delaunay Triangulation with Application in Ad Hoc Wireless Networks. IEEE Trans. Parallel Distrib. Syst. 14(10): 1035-1047 (2003)

Gruia Calinescu: Computing 2-Hop Neighborhoods in Ad Hoc Wireless Networks. ADHOC-NOW 2003: 175-186

Gruia Calinescu, Peng-Jun Wan: Range Assignment for High Connectivity in Wireless Ad Hoc Networks. ADHOC-NOW 2003: 235-246

Gruia Calinescu, Sanjiv Kapoor, Alexander Olshevsky, Alexander Zelikovsky: Network Lifetime and Power Assignment in ad hoc Wireless Networks. ESA 2003: 114-126

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

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: 1889-1894

Gruia Calinescu, Peng-Jun Wan: Traffic Partition in WDM/SONET Rings to Minimize SONET ADMs. J. Comb. Optim. 6(4): 425-453 (2002)

Gruia Calinescu, Peng-Jun Wan: Splittable traffic partition in WDM/SONET rings to minimize SONET ADMs. Theor. Comput. Sci. 276(1-2): 33-50 (2002)

Peng-Jun Wan, Gruia Calinescu, Xiang-Yang Li, Ophir Frieder: Minimum-Energy Broadcasting in Static Ad Hoc Wireless Networks. Wireless Networks 8(6): 607-617 (2002)

Gruia Calinescu, Ion I. Mandoiu, Alexander Zelikovsky: Symmetric Connectivity with Minimum Power Consumption in Radio Networks. IFIP TCS 2002: 119-130

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: 401-414

Gruia Calinescu, Cristina G. Fernandes: Multicuts in Unweighted Digraphs with Bounded Degree and Bounded Tree-Width. Electronic Notes in Discrete Mathematics 7: 194-197 (2001)

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

Peng-Jun Wan, Gruia Calinescu, Xiang-Yang Li, Ophir Frieder: Minimum-Energy Broadcast Routing in Static Ad Hoc Wireless Networks. INFOCOM 2001: 1162-1171

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

Gruia Calinescu, Howard J. Karloff, Yuval Rabani: Approximation algorithms for the 0-extension problem. SODA 2001: 8-16

Amihood Amir, Gruia Calinescu: Alphabet-Independent and Scaled Dictionary Matching. J. Algorithms 36(1): 34-62 (2000)

Gruia Calinescu, Howard J. Karloff, Yuval Rabani: An Improved Approximation Algorithm for MULTIWAY CUT. J. Comput. Syst. Sci. 60(3): 564-574 (2000)

Peng-Jun Wan, Gruia Calinescu, Ophir Frieder: Grooming of arbitrary traffic in SONET/WDM BLSRs. IEEE Journal on Selected Areas in Communications 18(10): 1995-2003 (2000)

Gruia Calinescu, Peng-Jun Wan: Wavelength Assignment in WDM Rings with Splitable Lightpaths. ISPAN 2000: 216-223

Gruia Calinescu, Cristina G. Fernandes, Ulrich Finkler, Howard J. Karloff: A Better Approximation Algorithm for Finding Planar Subgraphs. J. Algorithms 27(2): 269-302 (1998)

Gruia Calinescu, Cristina G. Fernandes, Bruce A. Reed: Multicuts in Unweighted Graphs with Bounded Degree and Bounded Tree-Width. IPCO 1998: 137-152

Gruia Calinescu, Howard J. Karloff, Yuval Rabani: An Improved Approximation Algorithm for Multiway Cut. STOC 1998: 48-52

Gruia Calinescu, Cristina G. Fernandes: Finding Large Planar Subgraphs and Large Subgraphs of a Given Genus. COCOON 1996: 152-161

Amihood Amir, Gruia Calinescu: Alphabet Independent and Dictionary Scaled Matching. CPM 1996: 320-334

Gruia Calinescu, Cristina G. Fernandes, Ulrich Finkler, Howard J. Karloff: A Better Approximation Algorithm for Finding Planar Subgraphs. SODA 1996: 16-25