Gruia Calinescu

Hemanshu Kaul

Bahareh Kudarzi

Discret. Appl. Math., January, 2024

Online Flexible Busy Time Scheduling on Heterogeneous Machines.

[BibT_eX]

[DOI]

CoRR, 2024

2023

Combination Algorithms for Steiner Tree Variants.

[BibT_eX]

[DOI]

Xiaolang Wang

Algorithmica, 2023

2021

A new LP rounding algorithm for the active time problem.

[BibT_eX]

[DOI]

Ian Albuquerque Raymundo Da Silva

Kai Wang

J. Sched., 2021

2020

Faster compression of patterns to Rectangle Rule Lists.

[BibT_eX]

[DOI]

Nathan De Graaf

Theor. Comput. Sci., 2020

2019

Improved approximation algorithms for minimum power covering problems.

[BibT_eX]

[DOI]

Guy Kortsarz

Zeev Nutov

Theor. Comput. Sci., 2019

Client assignment problems for latency minimization.

[BibT_eX]

[DOI]

Xiaolang Wang

J. Comb. Optim., 2019

2018

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

[BibT_eX]

[DOI]

IEEE Trans. Computers, 2018

Topology Control Problems for Wireless Ad hoc Networks.

[BibT_eX]

Errol L. Lloyd

S. S. Ravi

Proceedings of the Handbook of Approximation Algorithms and Metaheuristics, 2018

Maximum Planar Subgraph.

[BibT_eX]

Proceedings of the Handbook of Approximation Algorithms and Metaheuristics, 2018

2017

T-joins in strongly connected hypergraphs.

[BibT_eX]

[DOI]

Discret. Math. Algorithms Appl., 2017

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

[BibT_eX]

[DOI]

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

2016

Multiway Cut.

[BibT_eX]

[DOI]

Encyclopedia of Algorithms, 2016

Improved approximation algorithms for single-tiered relay placement.

[BibT_eX]

[DOI]

J. Comb. Optim., 2016

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

[BibT_eX]

[DOI]

J. Comb. Optim., 2016

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

[BibT_eX]

[DOI]

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

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

[BibT_eX]

[DOI]

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

2015

Bounding the payment of approximate truthful mechanisms.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2015

[BibT_eX]

[DOI]

Minming Li

Algorithmica, 2015

2014

Relay placement for two-connectivity.

[BibT_eX]

[DOI]

Discret. Optim., 2014

Sequential dependency computation via geometric data structures.

[BibT_eX]

[DOI]

Comput. Geom., 2014

Minimum Power Broadcast: Fast Variants of Greedy Approximations.

[BibT_eX]

[DOI]

Kan Qiao

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

2013

Approximate Min-Power Strong Connectivity.

[BibT_eX]

[DOI]

SIAM J. Discret. Math., 2013

Faster approximation for Symmetric Min-Power Broadcast.

[BibT_eX]

[DOI]

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

2012

1.85 Approximation for Min-Power Strong Connectivity

[BibT_eX]

[DOI]

CoRR, 2012

Maximum Series-Parallel Subgraph.

[BibT_eX]

[DOI]

Hemanshu Kaul

Algorithmica, 2012

Asymmetric topology control: Exact solutions and fast approximations.

[BibT_eX]

[DOI]

Kan Qiao

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

2011

An improved approximation algorithm for resource allocation.

[BibT_eX]

[DOI]

ACM Trans. Algorithms, 2011

Maximizing a Monotone Submodular Function Subject to a Matroid Constraint.

[BibT_eX]

[DOI]

SIAM J. Comput., 2011

Interference-aware broadcast scheduling in wireless networks.

[BibT_eX]

[DOI]

Sutep Tongngam

Ad Hoc Networks, 2011

Stochastic Strategic Routing Reduces Attack Effects.

[BibT_eX]

[DOI]

Proceedings of the Global Communications Conference, 2011

Adversary Games in Secure/Reliable Network Routing.

[BibT_eX]

[DOI]

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

2010

Multipath Network Flows: Bounded Buffers and Jitter.

[BibT_eX]

[DOI]

Nandakiran Kirubanandan

Sutep Tongngam

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

Min-Power Strong Connectivity.

[BibT_eX]

[DOI]

Proceedings of the Approximation, 2010

2009

Disjoint bases in a polymatroid.

[BibT_eX]

[DOI]

Chandra Chekuri

Jan Vondrák

Random Struct. Algorithms, 2009

Maximum Series-Parallel Subgraph.

[BibT_eX]

[DOI]

Hemanshu Kaul

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

2008

Wireless Ad Hoc Networks: Power Assignment.

[BibT_eX]

[DOI]

Encyclopedia of Wireless and Mobile Communications, 2008

Multiway Cut.

[BibT_eX]

[DOI]

Proceedings of the Encyclopedia of Algorithms - 2008 Edition, 2008

Reconfigurations in Graphs and Grids.

[BibT_eX]

[DOI]

Adrian Dumitrescu

János Pach

SIAM J. Discret. Math., 2008

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

[BibT_eX]

[DOI]

Michael J. Pelsmajer

J. Graph Algorithms Appl., 2008

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

[BibT_eX]

[DOI]

Discret. Math. Theor. Comput. Sci., 2008

Relay Nodes in Wireless Sensor Networks.

[BibT_eX]

[DOI]

Sutep Tongngam

Proceedings of the Wireless Algorithms, 2008

Monitoring schedules for randomly deployed sensor networks.

[BibT_eX]

[DOI]

Robert B. Ellis

Proceedings of the DIALM-POMC Joint Workshop on Foundations of Mobile Computing, 2008

2007

Maximum Planar Subgraph.

[BibT_eX]

[DOI]

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

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

[BibT_eX]

[DOI]

J. Univers. Comput. Sci., 2007

A note on data structures for maintaining bipartitions.

[BibT_eX]

[DOI]

J. Discrete Algorithms, 2007

On Ring Grooming in optical networks.

[BibT_eX]

[DOI]

J. Comb. Optim., 2007

Compressing rectilinear pictures and minimizing access control lists.

[BibT_eX]

[DOI]

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

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

[BibT_eX]

[DOI]

Proceedings of the Integer Programming and Combinatorial Optimization, 2007

Approximation Algorithms For Multipath Setup.

[BibT_eX]

[DOI]

Tricha Anjali

Sanjiv Kapoor

Proceedings of the Global Communications Conference, 2007

2006

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

[BibT_eX]

[DOI]

Wirel. Networks, 2006

Range Assignment for Biconnectivity and <i>k</i>-Edge Connectivity in Wireless Ad Hoc Networks.

[BibT_eX]

[DOI]

Mob. Networks Appl., 2006

A fast localized algorithm for scheduling sensors.

[BibT_eX]

[DOI]

J. Parallel Distributed Comput., 2006

Bounded-hops power assignment in ad hoc wireless networks.

[BibT_eX]

[DOI]

Sanjiv Kapoor

Mohammad Sarwat

Discret. Appl. Math., 2006

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

[BibT_eX]

[DOI]

Proceedings of the Seventh International Conference on Software Engineering, 2006

2005

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

[BibT_eX]

[DOI]

Wirel. Networks, 2005

The Polymatroid Steiner Problems.

[BibT_eX]

[DOI]

J. Comb. Optim., 2005

Separating Points by Axis-parallel Lines.

[BibT_eX]

[DOI]

Int. J. Comput. Geom. Appl., 2005

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

[BibT_eX]

[DOI]

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

Energy-efficient continuous and event-driven monitoring.

[BibT_eX]

[DOI]

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.

[BibT_eX]

[DOI]

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

2004

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

[BibT_eX]

[DOI]

Chih-Wei Yi

IEEE/ACM Trans. Netw., 2004

Approximation Algorithms for the 0-Extension Problem.

[BibT_eX]

[DOI]

Yuval Rabani

SIAM J. Comput., 2004

Selecting Forwarding Neighbors in Wireless Ad Hoc Networks.

[BibT_eX]

[DOI]

Mob. Networks Appl., 2004

Power efficient monitoring management in sensor networks.

[BibT_eX]

[DOI]

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

Separating points by axis-parallel lines.

[BibT_eX]

[DOI]

Adrian Dumitrescu

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

2003

Localized Delaunay Triangulation with Application in Ad Hoc Wireless Networks.

[BibT_eX]

[DOI]

IEEE Trans. Parallel Distributed Syst., 2003

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

[BibT_eX]

[DOI]

Bruce A. Reed

J. Algorithms, 2003

A New Approximation Algorithm for Finding Heavy Planar Subgraphs.

[BibT_eX]

[DOI]

Algorithmica, 2003

Power efficient range assignment in ad-hoc wireless networks.

[BibT_eX]

[DOI]

Proceedings of the 2003 IEEE Wireless Communications and Networking, 2003

Primal-dual algorithms for QoS multimedia multicast.

[BibT_eX]

[DOI]

Proceedings of the Global Telecommunications Conference, 2003

Network Lifetime and Power Assignment in ad hoc Wireless Networks.

[BibT_eX]

[DOI]

Proceedings of the Algorithms, 2003

Range Assignment for High Connectivity in Wireless Ad Hoc Networks.

[BibT_eX]

[DOI]

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

Computing 2-Hop Neighborhoods in Ad Hoc Wireless Networks.

[BibT_eX]

[DOI]

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

2002

Minimum-Energy Broadcasting in Static Ad Hoc Wireless Networks.

[BibT_eX]

[DOI]

Wirel. Networks, 2002

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

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2002

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

[BibT_eX]

[DOI]

IEEE J. Sel. Areas Commun., 2002

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

[BibT_eX]

[DOI]

J. Comb. Optim., 2002

Improved Approximation Algorithms for Resource Allocation.

[BibT_eX]

[DOI]

Proceedings of the Integer Programming and Combinatorial Optimization, 2002

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

[BibT_eX]

[DOI]

Xiang-Yang Li

Proceedings of the Proceedings IEEE INFOCOM 2002, 2002

Symmetric Connectivity with Minimum Power Consumption in Radio Networks.

[BibT_eX]

[DOI]

Ion I. Mandoiu

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.

[BibT_eX]

[DOI]

Electron. Notes Discret. Math., 2001

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

[BibT_eX]

[DOI]

Proceedings of the Proceedings IEEE INFOCOM 2001, 2001

2000

Grooming of arbitrary traffic in SONET/WDM BLSRs.

[BibT_eX]

[DOI]

IEEE J. Sel. Areas Commun., 2000

An Improved Approximation Algorithm for MULTIWAY CUT.

[BibT_eX]

Yuval Rabani

J. Comput. Syst. Sci., 2000

Alphabet-Independent and Scaled Dictionary Matching.

[BibT_eX]

[DOI]

Amihood Amir

J. Algorithms, 2000

Wavelength Assignment in WDM Rings with Splitable Lightpaths.

[BibT_eX]

[DOI]

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

1998

A Better Approximation Algorithm for Finding Planar Subgraphs.

[BibT_eX]

[DOI]

Ulrich Finkler

J. Algorithms, 1998

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

[BibT_eX]

[DOI]

Bruce A. Reed

Proceedings of the Integer Programming and Combinatorial Optimization, 1998

1996

Alphabet Independent and Dictionary Scaled Matching.

[BibT_eX]

[DOI]

Amihood Amir

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

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

[BibT_eX]

[DOI]