| Hits ?▲ |
Authors |
Title |
Venue |
Year |
Link |
Author keywords |
| 1 | Gruia Calinescu, Cristina G. Fernandes, Hemanshu Kaul, Alexander Zelikovsky |
Maximum Series-Parallel Subgraph.  |
Algorithmica  |
2012 |
DBLP DOI BibTeX RDF |
|
| 1 | Gruia Calinescu |
Relay Placement for Two-Connectivity.  |
Networking  |
2012 |
DBLP DOI BibTeX RDF |
|
| 1 | Gruia Calinescu, K. Qiao |
Asymmetric topology control: Exact solutions and fast approximations.  |
INFOCOM  |
2012 |
DBLP DOI BibTeX RDF |
|
| 1 | Gruia Calinescu, Amit Chakrabarti, Howard J. Karloff, Yuval Rabani |
An improved approximation algorithm for resource allocation.  |
ACM Transactions on Algorithms  |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Gruia Calinescu, Chandra Chekuri, Martin Pál, Jan Vondrák |
Maximizing a Monotone Submodular Function Subject to a Matroid Constraint.  |
SIAM J. Comput.  |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Gruia Calinescu, Sutep Tongngam |
Interference-aware broadcast scheduling in wireless networks.  |
Ad Hoc Networks  |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Gruia Calinescu, Howard J. Karloff |
Sequential Dependency Computation via Geometric Data Structures.  |
CCCG  |
2011 |
DBLP BibTeX RDF |
|
| 1 | Gruia Calinescu, Minming Li |
Register Loading via Linear Programming.  |
WADS  |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Gruia Calinescu, Sanjiv Kapoor, K. Qiao, Junghwan Shin |
Stochastic Strategic Routing Reduces Attack Effects.  |
GLOBECOM  |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Tricha Anjali, Gruia Calinescu, Alexander Fortin, Sanjiv Kapoor, Nandakiran Kirubanandan, Sutep Tongngam |
Multipath Network Flows: Bounded Buffers and Jitter.  |
INFOCOM  |
2010 |
DBLP DOI BibTeX RDF |
|
| 1 | Gruia Calinescu |
Min-Power Strong Connectivity.  |
APPROX-RANDOM  |
2010 |
DBLP DOI BibTeX RDF |
|
| 1 | Gruia Calinescu, Chandra Chekuri, Jan Vondrák |
Disjoint bases in a polymatroid.  |
Random Struct. Algorithms  |
2009 |
DBLP DOI BibTeX RDF |
|
| 1 | Gruia Calinescu, Cristina G. Fernandes, Hemanshu Kaul |
Maximum Series-Parallel Subgraph.  |
WG  |
2009 |
DBLP DOI BibTeX RDF |
|
| 1 | Gruia Calinescu, Cristina G. Fernandes |
On the k-Structure Ratio in Planar and Outerplanar Graphs.  |
Discrete Mathematics & Theoretical Computer Science  |
2008 |
DBLP BibTeX RDF |
|
| 1 | Gruia Calinescu, Adrian Dumitrescu, János Pach |
Reconfigurations in Graphs and Grids.  |
SIAM J. Discrete Math.  |
2008 |
DBLP DOI BibTeX RDF |
|
| 1 | Gruia Calinescu, Michael J. Pelsmajer |
Fast edge colorings with fixed number of colors to minimize imbalance.  |
J. Graph Algorithms Appl.  |
2008 |
DBLP BibTeX RDF |
|
| 1 | Gruia Calinescu |
Multiway Cut.  |
Encyclopedia of Algorithms  |
2008 |
DBLP DOI BibTeX RDF |
|
| 1 | Gruia Calinescu, Sutep Tongngam |
Relay Nodes in Wireless Sensor Networks.  |
WASA  |
2008 |
DBLP DOI BibTeX RDF |
|
| 1 | Gruia Calinescu, Sutep Tongngam |
Interference-Aware Broadcast Scheduling in Wireless Networks.  |
MSN  |
2008 |
DBLP DOI BibTeX RDF |
approximation algoriithm, scheduling, wireless network, broadcast |
| 1 | Gruia Calinescu, Peng-Jun Wan |
On Ring Grooming in optical networks.  |
J. Comb. Optim.  |
2007 |
DBLP DOI BibTeX RDF |
Ring grooming, Approximation algorithms, Matching |
| 1 | Gruia Calinescu, Ion I. Mandoiu, Alexander Zelikovsky, Marius Zimand |
Selected Papers from the 1st ACIS International Workshop on Self-Assembling Wireless Networks.  |
J. UCS  |
2007 |
DBLP BibTeX RDF |
|
| 1 | Gruia Calinescu |
A note on data structures for maintaining bipartitions.  |
J. Discrete Algorithms  |
2007 |
DBLP DOI BibTeX RDF |
|
| 1 | David Applegate, Gruia Calinescu, David S. Johnson, Howard J. Karloff, Katrina Ligett, Jia Wang |
Compressing rectilinear pictures and minimizing access control lists.  |
SODA  |
2007 |
DBLP DOI BibTeX RDF |
|
| 1 | Tricha Anjali, Gruia Calinescu, Sanjiv Kapoor |
Approximation Algorithms For Multipath Setup.  |
GLOBECOM  |
2007 |
DBLP DOI BibTeX RDF |
|
| 1 | Gruia Calinescu, Chandra Chekuri, Martin Pál, Jan Vondrák |
Maximizing a Submodular Set Function Subject to a Matroid Constraint (Extended Abstract).  |
IPCO  |
2007 |
DBLP DOI BibTeX RDF |
|
| 1 | Gruia Calinescu, Peng-Jun Wan |
Range Assignment for Biconnectivity and k-Edge Connectivity in Wireless Ad Hoc Networks.  |
MONET  |
2006 |
DBLP DOI BibTeX RDF |
approximation algorithms, distributed algorithm, NP-hardness, topology control, power assignment |
| 1 | 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  |
2006 |
DBLP DOI BibTeX RDF |
power range assignment, symmetric connectivity, algorithms, ad hoc wireless networks |
| 1 | Gruia Calinescu |
A fast localized algorithm for scheduling sensors.  |
J. Parallel Distrib. Comput.  |
2006 |
DBLP DOI BibTeX RDF |
|
| 1 | Gruia Calinescu, Sanjiv Kapoor, Mohammad Sarwat |
Bounded-hops power assignment in ad hoc wireless networks.  |
Discrete Applied Mathematics  |
2006 |
DBLP DOI BibTeX RDF |
|
| 1 | Gruia Calinescu |
Broadcast with Hitch-hiking in Wireless Ad-Hoc Networks (Invited Talk Abstract).  |
SNPD  |
2006 |
DBLP DOI BibTeX RDF |
|
| 1 | Gruia Calinescu, Adrian Dumitrescu, János Pach |
Reconfigurations in Graphs and Grids.  |
LATIN  |
2006 |
DBLP DOI BibTeX RDF |
|
| 1 | Gruia Calinescu, Michael J. Pelsmajer |
Fast Edge Colorings with Fixed Number of Colors to Minimize Imbalance.  |
FSTTCS  |
2006 |
DBLP DOI BibTeX RDF |
|
| 1 | Gruia Calinescu, Alexander Zelikovsky |
The Polymatroid Steiner Problems.  |
J. Comb. Optim.  |
2005 |
DBLP DOI BibTeX RDF |
wireless sensor networks, approximation algorithms, Steiner trees, polymatroid |
| 1 | Peng-Jun Wan, Gruia Calinescu, Xiang-Yang Li, Ophir Frieder |
Erratum: Minimum-Energy Broadcast in Static Ad Hoc Wireless Networks.  |
Wireless Networks  |
2005 |
DBLP DOI BibTeX RDF |
|
| 1 | Gruia Calinescu, Adrian Dumitrescu, Howard J. Karloff, Peng-Jun Wan |
Separating Points by Axis-parallel Lines.  |
Int. J. Comput. Geometry Appl.  |
2005 |
DBLP DOI BibTeX RDF |
|
| 1 | Dumitru Brinza, Gruia Calinescu, Sutep Tongngam, Alexander Zelikovsky |
Energy-efficient continuous and event-driven monitoring.  |
MASS  |
2005 |
DBLP DOI BibTeX RDF |
|
| 1 | Gruia Calinescu |
Analytical bounds on broadcast with hitch-hiking in wireless ad-hoc networks.  |
MASS  |
2005 |
DBLP DOI BibTeX RDF |
|
| 1 | Gruia Calinescu, Ion I. Mandoiu, Peng-Jun Wan, Alexander Zelikovsky |
Selecting Forwarding Neighbors in Wireless Ad Hoc Networks.  |
MONET  |
2004 |
DBLP DOI BibTeX RDF |
disk cover, approximation algorithms, broadcast, wireless ad hoc networks, unit-disk graphs |
| 1 | Peng-Jun Wan, Gruia Calinescu, Chih-Wei Yi |
Minimum-power multicast routing in static ad hoc wireless networks.  |
IEEE/ACM Trans. Netw.  |
2004 |
DBLP DOI BibTeX RDF |
approximation algorithms, power control, multicast routing |
| 1 | Gruia Calinescu, Howard J. Karloff, Yuval Rabani |
Approximation Algorithms for the 0-Extension Problem.  |
SIAM J. Comput.  |
2004 |
DBLP DOI BibTeX RDF |
|
| 1 | Gruia Calinescu, Adrian Dumitrescu, Peng-Jun Wan |
Separating points by axis-parallel lines.  |
CCCG  |
2004 |
DBLP BibTeX RDF |
|
| 1 | Gruia Calinescu, Alexander Zelikovsky |
The Polymatroid Steiner Problems.  |
ISAAC  |
2004 |
DBLP DOI BibTeX RDF |
|
| 1 | Gruia Calinescu |
Bounding the Payment of Approximate Truthful Mechanisms.  |
ISAAC  |
2004 |
DBLP DOI BibTeX RDF |
|
| 1 | Gruia Calinescu, Cristina G. Fernandes, Howard J. Karloff, Alexander Zelikovsky |
A New Approximation Algorithm for Finding Heavy Planar Subgraphs.  |
Algorithmica  |
2003 |
DBLP DOI BibTeX RDF |
Weighted planar graph, Approximation algorithm, Performance ratio |
| 1 | Xiang-Yang Li, Gruia Calinescu, Peng-Jun Wan, Yu Wang 0003 |
Localized Delaunay Triangulation with Application in Ad Hoc Wireless Networks.  |
IEEE Trans. Parallel Distrib. Syst.  |
2003 |
DBLP DOI BibTeX RDF |
localized method, routing, wireless networks, topology control, Delaunay triangulation, spanner, planar |
| 1 | Gruia Calinescu, Cristina G. Fernandes, Bruce A. Reed |
Multicuts in unweighted graphs and digraphs with bounded degree and bounded tree-width.  |
J. Algorithms  |
2003 |
DBLP DOI BibTeX RDF |
|
| 1 | Gruia Calinescu, Sanjiv Kapoor, Alexander Olshevsky, Alexander Zelikovsky |
Network Lifetime and Power Assignment in ad hoc Wireless Networks.  |
ESA  |
2003 |
DBLP DOI BibTeX RDF |
|
| 1 | Gruia Calinescu |
Computing 2-Hop Neighborhoods in Ad Hoc Wireless Networks.  |
ADHOC-NOW  |
2003 |
DBLP DOI BibTeX RDF |
|
| 1 | Gruia Calinescu, Peng-Jun Wan |
Range Assignment for High Connectivity in Wireless Ad Hoc Networks.  |
ADHOC-NOW  |
2003 |
DBLP DOI BibTeX RDF |
|
| 1 | Gruia Calinescu, Peng-Jun Wan |
Traffic Partition in WDM/SONET Rings to Minimize SONET ADMs.  |
J. Comb. Optim.  |
2002 |
DBLP DOI BibTeX RDF |
|
| 1 | Gruia Calinescu, Peng-Jun Wan |
Splittable traffic partition in WDM/SONET rings to minimize SONET ADMs.  |
Theor. Comput. Sci.  |
2002 |
DBLP DOI BibTeX RDF |
|
| 1 | Peng-Jun Wan, Gruia Calinescu, Xiang-Yang Li, Ophir Frieder |
Minimum-Energy Broadcasting in Static Ad Hoc Wireless Networks.  |
Wireless Networks  |
2002 |
DBLP DOI BibTeX RDF |
|
| 1 | Gruia Calinescu, Ion I. Mandoiu, Alexander Zelikovsky |
Symmetric Connectivity with Minimum Power Consumption in Radio Networks.  |
IFIP TCS  |
2002 |
DBLP BibTeX RDF |
|
| 1 | Xiang-Yang Li, Gruia Calinescu, Peng-Jun Wan |
Distributed Construction of Planar Spanner and Routing for Ad Hoc Wireless Networks.  |
INFOCOM  |
2002 |
DBLP BibTeX RDF |
|
| 1 | Gruia Calinescu, Amit Chakrabarti, Howard J. Karloff, Yuval Rabani |
Improved Approximation Algorithms for Resource Allocation.  |
IPCO  |
2002 |
DBLP BibTeX RDF |
|
| 1 | Gruia Calinescu, Cristina G. Fernandes |
Multicuts in Unweighted Digraphs with Bounded Degree and Bounded Tree-Width.  |
Electronic Notes in Discrete Mathematics  |
2001 |
DBLP DOI BibTeX RDF |
|
| 1 | Gruia Calinescu, Howard J. Karloff, Yuval Rabani |
Approximation algorithms for the 0-extension problem.  |
SODA  |
2001 |
DBLP DOI BibTeX RDF |
|
| 1 | Gruia Calinescu, Peng-Jun Wan |
Traffic partition in WDM/SONET rings to minimize SONET ADMs.  |
IPDPS  |
2001 |
DBLP BibTeX RDF |
|
| 1 | Peng-Jun Wan, Gruia Calinescu, Xiang-Yang Li, Ophir Frieder |
Minimum-Energy Broadcast Routing in Static Ad Hoc Wireless Networks.  |
INFOCOM  |
2001 |
DBLP BibTeX RDF |
|
| 1 | Gruia Calinescu, Ion I. Mandoiu, Peng-Jun Wan, Alexander Zelikovsky |
Selecting forwarding neighbors in wireless Ad Hoc networks.  |
DIAL-M  |
2001 |
DBLP DOI BibTeX RDF |
|
| 1 | Amihood Amir, Gruia Calinescu |
Alphabet-Independent and Scaled Dictionary Matching.  |
J. Algorithms  |
2000 |
DBLP DOI BibTeX RDF |
|
| 1 | Gruia Calinescu, Howard J. Karloff, Yuval Rabani |
An Improved Approximation Algorithm for MULTIWAY CUT.  |
J. Comput. Syst. Sci.  |
2000 |
DBLP BibTeX RDF |
|
| 1 | Peng-Jun Wan, Gruia Calinescu, Ophir Frieder |
Grooming of arbitrary traffic in SONET/WDM BLSRs.  |
IEEE Journal on Selected Areas in Communications  |
2000 |
DBLP DOI BibTeX RDF |
|
| 1 | Gruia Calinescu, Peng-Jun Wan |
Wavelength Assignment in WDM Rings with Splitable Lightpaths.  |
ISPAN  |
2000 |
DBLP DOI BibTeX RDF |
WADM, approximation algorithm, optical networks, Wavelength division multiplexing (WDM), add-drop multiplexer (ADM), SONET, grooming |
| 1 | Gruia Calinescu, Cristina G. Fernandes, Ulrich Finkler, Howard J. Karloff |
A Better Approximation Algorithm for Finding Planar Subgraphs.  |
J. Algorithms  |
1998 |
DBLP DOI BibTeX RDF |
|
| 1 | Gruia Calinescu, Cristina G. Fernandes, Bruce A. Reed |
Multicuts in Unweighted Graphs with Bounded Degree and Bounded Tree-Width.  |
IPCO  |
1998 |
DBLP DOI BibTeX RDF |
|
| 1 | Gruia Calinescu, Howard J. Karloff, Yuval Rabani |
An Improved Approximation Algorithm for Multiway Cut.  |
STOC  |
1998 |
DBLP DOI BibTeX RDF |
|
| 1 | Gruia Calinescu, Cristina G. Fernandes, Ulrich Finkler, Howard J. Karloff |
A Better Approximation Algorithm for Finding Planar Subgraphs.  |
SODA  |
1996 |
DBLP DOI BibTeX RDF |
|
| 1 | Amihood Amir, Gruia Calinescu |
Alphabet Independent and Dictionary Scaled Matching.  |
CPM  |
1996 |
DBLP DOI BibTeX RDF |
|
| 1 | Gruia Calinescu, Cristina G. Fernandes |
Finding Large Planar Subgraphs and Large Subgraphs of a Given Genus.  |
COCOON  |
1996 |
DBLP DOI BibTeX RDF |
|