# Gruia Calinescu

According to our database

Collaborative distances:

^{1}, Gruia Calinescu authored at least 86 papers between 1996 and 2019.Collaborative distances:

## Timeline

#### Legend:

Book In proceedings Article PhD thesis Other## Links

#### On csauthors.net:

## Bibliography

2019

Improved approximation algorithms for minimum power covering problems.

Theor. Comput. Sci., 2019

Client assignment problems for latency minimization.

J. Comb. Optim., 2019

2018

Energy Optimal Task Scheduling with Normally-Off Local Memory and Sleep-Aware Shared Memory with Access Conflict.

IEEE Trans. Computers, 2018

Faster Compression of Patterns to Rectangle Rule Lists.

Proceedings of the Algorithmic Aspects in Information and Management, 2018

Topology Control Problems for Wireless Ad hoc Networks.

Proceedings of the Handbook of Approximation Algorithms and Metaheuristics, 2018

Maximum Planar Subgraph.

Proceedings of the Handbook of Approximation Algorithms and Metaheuristics, 2018

2017

T-joins in strongly connected hypergraphs.

Discrete Math., Alg. and Appl., 2017

An FPTAS of Minimizing Total Weighted Completion Time on Single Machine with Position Constraint.

Proceedings of the 28th International Symposium on Algorithms and Computation, 2017

2016

Multiway Cut.

Encyclopedia of Algorithms, 2016

Improved approximation algorithms for single-tiered relay placement.

J. Comb. Optim., 2016

1.61-approximation for min-power strong connectivity with two power levels.

J. Comb. Optim., 2016

Energy-Aware Real-Time Task Scheduling on Local/Shared Memory Systems.

Proceedings of the 2016 IEEE Real-Time Systems Symposium, 2016

Improved Algorithms for Two Energy-Optimal Routing Problems in Ad-Hoc Wireless Networks.

Proceedings of the 2016 IEEE International Conferences on Big Data and Cloud Computing (BDCloud), 2016

2015

Bounding the payment of approximate truthful mechanisms.

Theor. Comput. Sci., 2015

Register Loading via Linear Programming.

Algorithmica, 2015

2014

Relay placement for two-connectivity.

Discrete Optimization, 2014

Sequential dependency computation via geometric data structures.

Comput. Geom., 2014

Minimum Power Broadcast: Fast Variants of Greedy Approximations.

Proceedings of the 11th IEEE International Conference on Mobile Ad Hoc and Sensor Systems, 2014

2013

Approximate Min-Power Strong Connectivity.

SIAM J. Discrete Math., 2013

Faster approximation for Symmetric Min-Power Broadcast.

Proceedings of the 25th Canadian Conference on Computational Geometry, 2013

2012

1.85 Approximation for Min-Power Strong Connectivity

CoRR, 2012

Maximum Series-Parallel Subgraph.

Algorithmica, 2012

Asymmetric topology control: Exact solutions and fast approximations.

Proceedings of the IEEE INFOCOM 2012, Orlando, FL, USA, March 25-30, 2012, 2012

2011

An improved approximation algorithm for resource allocation.

ACM Trans. Algorithms, 2011

Maximizing a Monotone Submodular Function Subject to a Matroid Constraint.

SIAM J. Comput., 2011

Interference-aware broadcast scheduling in wireless networks.

Ad Hoc Networks, 2011

Stochastic Strategic Routing Reduces Attack Effects.

Proceedings of the Global Communications Conference, 2011

Adversary Games in Secure/Reliable Network Routing.

Proceedings of the Game Theory for Networks - 2nd International ICST Conference, 2011

2010

Multipath Network Flows: Bounded Buffers and Jitter.

Proceedings of the INFOCOM 2010. 29th IEEE International Conference on Computer Communications, 2010

Min-Power Strong Connectivity.

Proceedings of the Approximation, 2010

2009

Disjoint bases in a polymatroid.

Random Struct. Algorithms, 2009

Maximum Series-Parallel Subgraph.

Proceedings of the Graph-Theoretic Concepts in Computer Science, 2009

2008

Wireless Ad Hoc Networks: Power Assignment.

Encyclopedia of Wireless and Mobile Communications, 2008

Multiway Cut.

Proceedings of the Encyclopedia of Algorithms - 2008 Edition, 2008

Reconfigurations in Graphs and Grids.

SIAM J. Discrete Math., 2008

Fast edge colorings with fixed number of colors to minimize imbalance.

J. Graph Algorithms Appl., 2008

On the k-Structure Ratio in Planar and Outerplanar Graphs.

Discrete Mathematics & Theoretical Computer Science, 2008

Relay Nodes in Wireless Sensor Networks.

Proceedings of the Wireless Algorithms, 2008

2007

Maximum Planar Subgraph.

Proceedings of the Handbook of Approximation Algorithms and Metaheuristics., 2007

Selected Papers from the 1st ACIS International Workshop on Self-Assembling Wireless Networks.

J. UCS, 2007

A note on data structures for maintaining bipartitions.

J. Discrete Algorithms, 2007

On Ring Grooming in optical networks.

J. Comb. Optim., 2007

Compressing rectilinear pictures and minimizing access control lists.

Proceedings of the Eighteenth Annual ACM-SIAM Symposium on Discrete Algorithms, 2007

Maximizing a Submodular Set Function Subject to a Matroid Constraint (Extended Abstract).

Proceedings of the Integer Programming and Combinatorial Optimization, 2007

Approximation Algorithms For Multipath Setup.

Proceedings of the Global Communications Conference, 2007

2006

Power Efficient Range Assignment for Symmetric Connectivity in Static Ad Hoc Wireless Networks.

Wireless Networks, 2006

Range Assignment for Biconnectivity and

*k*-Edge Connectivity in Wireless Ad Hoc Networks.
MONET, 2006

A fast localized algorithm for scheduling sensors.

J. Parallel Distrib. Comput., 2006

Bounded-hops power assignment in ad hoc wireless networks.

Discrete Applied Mathematics, 2006

Broadcast with Hitch-hiking in Wireless Ad-Hoc Networks (Invited Talk Abstract).

Proceedings of the Seventh International Conference on Software Engineering, 2006

2005

Erratum: Minimum-Energy Broadcast in Static Ad Hoc Wireless Networks.

Wireless Networks, 2005

The Polymatroid Steiner Problems.

J. Comb. Optim., 2005

Separating Points by Axis-parallel Lines.

Int. J. Comput. Geometry Appl., 2005

Analytical bounds on broadcast with hitch-hiking in wireless ad-hoc networks.

Proceedings of the IEEE 2nd International Conference on Mobile Adhoc and Sensor Systems, 2005

Energy-efficient continuous and event-driven monitoring.

Proceedings of the IEEE 2nd International Conference on Mobile Adhoc and Sensor Systems, 2005

A Survey of Algorithms for Power Assignment in Wireless Ad Hoc Networks.

Proceedings of the Handbook on Theoretical and Algorithmic Aspects of Sensor, 2005

2004

Minimum-power multicast routing in static ad hoc wireless networks.

IEEE/ACM Trans. Netw., 2004

Approximation Algorithms for the 0-Extension Problem.

SIAM J. Comput., 2004

Selecting Forwarding Neighbors in Wireless Ad Hoc Networks.

MONET, 2004

Power efficient monitoring management in sensor networks.

Proceedings of the 2004 IEEE Wireless Communications and Networking Conference , 2004

Separating points by axis-parallel lines.

Proceedings of the 16th Canadian Conference on Computational Geometry, 2004

2003

Localized Delaunay Triangulation with Application in Ad Hoc Wireless Networks.

IEEE Trans. Parallel Distrib. Syst., 2003

Multicuts in unweighted graphs and digraphs with bounded degree and bounded tree-width.

J. Algorithms, 2003

A New Approximation Algorithm for Finding Heavy Planar Subgraphs.

Algorithmica, 2003

Power efficient range assignment in ad-hoc wireless networks.

Proceedings of the 2003 IEEE Wireless Communications and Networking, 2003

Primal-dual algorithms for QoS multimedia multicast.

Proceedings of the Global Telecommunications Conference, 2003

Network Lifetime and Power Assignment in ad hoc Wireless Networks.

Proceedings of the Algorithms, 2003

Range Assignment for High Connectivity in Wireless Ad Hoc Networks.

Proceedings of the Ad-Hoc, Mobile, and Wireless Networks, Second International Conference, 2003

Computing 2-Hop Neighborhoods in Ad Hoc Wireless Networks.

Proceedings of the Ad-Hoc, Mobile, and Wireless Networks, Second International Conference, 2003

2002

Minimum-Energy Broadcasting in Static Ad Hoc Wireless Networks.

Wireless Networks, 2002

Splittable traffic partition in WDM/SONET rings to minimize SONET ADMs.

Theor. Comput. Sci., 2002

Minimizing electronic line terminals for automatic ring protection in general WDM optical networks.

IEEE Journal on Selected Areas in Communications, 2002

Traffic Partition in WDM/SONET Rings to Minimize SONET ADMs.

J. Comb. Optim., 2002

Improved Approximation Algorithms for Resource Allocation.

Proceedings of the Integer Programming and Combinatorial Optimization, 2002

Distributed Construction of Planar Spanner and Routing for Ad Hoc Wireless Networks.

Proceedings of the Proceedings IEEE INFOCOM 2002, 2002

Symmetric Connectivity with Minimum Power Consumption in Radio Networks.

Proceedings of the Foundations of Information Technology in the Era of Networking and Mobile Computing, 2002

2001

Multicuts in Unweighted Digraphs with Bounded Degree and Bounded Tree-Width.

Electronic Notes in Discrete Mathematics, 2001

Minimum-Energy Broadcast Routing in Static Ad Hoc Wireless Networks.

Proceedings of the Proceedings IEEE INFOCOM 2001, 2001

2000

Grooming of arbitrary traffic in SONET/WDM BLSRs.

IEEE Journal on Selected Areas in Communications, 2000

An Improved Approximation Algorithm for MULTIWAY CUT.

J. Comput. Syst. Sci., 2000

Alphabet-Independent and Scaled Dictionary Matching.

J. Algorithms, 2000

Wavelength Assignment in WDM Rings with Splitable Lightpaths.

Proceedings of the 5th International Symposium on Parallel Architectures, 2000

1998

A Better Approximation Algorithm for Finding Planar Subgraphs.

J. Algorithms, 1998

Multicuts in Unweighted Graphs with Bounded Degree and Bounded Tree-Width.

Proceedings of the Integer Programming and Combinatorial Optimization, 1998

1996

Alphabet Independent and Dictionary Scaled Matching.

Proceedings of the Combinatorial Pattern Matching, 7th Annual Symposium, 1996

Finding Large Planar Subgraphs and Large Subgraphs of a Given Genus.

Proceedings of the Computing and Combinatorics, Second Annual International Conference, 1996