Lisa Zhang

Bradley Magnetta

Proceedings of the 2022 IEEE International Conference on Image Processing, 2022

2019

Statistical Enrichment Models for Activity Inference from Imprecise Location Data.

[BibT_eX]

[DOI]

Proceedings of the 2019 IEEE Conference on Computer Communications, 2019

Quantified Understanding of Syrian Refugee Integration in Turkey.

[BibT_eX]

[DOI]

Proceedings of the Guide to Mobile Data Analytics in Refugee Scenarios, 2019

2018

A unified clustering approach for identifying functional zones in suburban and urban areas.

[BibT_eX]

[DOI]

Proceedings of the IEEE INFOCOM 2018, 2018

Structure of Utility Optimization in Regular and Irregular Wireless Scenarios.

[BibT_eX]

[DOI]

Proceedings of the 56th Annual Allerton Conference on Communication, 2018

2017

Egalitarian Graph Orientations.

[BibT_eX]

[DOI]

J. Graph Algorithms Appl., 2017

Extracting mobile user behavioral similarity via cell-level location trace.

[BibT_eX]

[DOI]

Proceedings of the 2017 IEEE Conference on Computer Communications Workshops, 2017

2016

Improving robustness of next-hop routing.

[BibT_eX]

[DOI]

J. Comb. Optim., 2016

Computing road signatures from cell sequences with minimum inconsistencies.

[BibT_eX]

[DOI]

Jin Cao

Proceedings of the IEEE Conference on Computer Communications Workshops, 2016

Tracking mobile users via standard routing engines.

[BibT_eX]

[DOI]

Proceedings of the 2016 Annual Conference on Information Science and Systems, 2016

2015

Rate-Adaptive Scheduling Policies for Network Stability and Energy Efficiency.

[BibT_eX]

[DOI]

IEEE/ACM Trans. Netw., 2015

Analysis of k-anonymity algorithms for streaming location data.

[BibT_eX]

[DOI]

Gordon T. Wilfong

Proceedings of the 2015 IEEE Conference on Computer Communications Workshops, 2015

Sparsifying network topologies for application guidance.

[BibT_eX]

[DOI]

Michael Scharf

Gordon T. Wilfong

Proceedings of the IFIP/IEEE International Symposium on Integrated Network Management, 2015

2014

Rate-adaptive weighted fair queueing for energy-aware scheduling.

[BibT_eX]

[DOI]

Inf. Process. Lett., 2014

2013

Utility optimization in heterogeneous networks via CSMA-based algorithms.

[BibT_eX]

[DOI]

Proceedings of the 11th International Symposium and Workshops on Modeling and Optimization in Mobile, 2013

Worst-case delay bounds for uniform load-balanced switch fabrics.

[BibT_eX]

[DOI]

Steven Fortune

Rae McLellan

Proceedings of IEEE International Conference on Communications, 2013

Collector-based cell reordering in load-balanced switch fabrics.

[BibT_eX]

[DOI]

Steven Fortune

Rae McLellan

Proceedings of the IEEE 14th International Conference on High Performance Switching and Routing, 2013

Hierarchical community decomposition via oblivious routing techniques.

[BibT_eX]

[DOI]

Proceedings of the Conference on Online Social Networks, 2013

2012

Routing for Power Minimization in the Speed Scaling Model.

[BibT_eX]

[DOI]

Antonio Fernández Anta

Wenbo Zhao

IEEE/ACM Trans. Netw., 2012

Multi-Carrier Multi-Rate Utility Optimization in Heterogeneous Networks via CSMA-Based Algorithms

[BibT_eX]

[DOI]

CoRR, 2012

Scheduling algorithms for optimizing the tradeoffs between delay, queue size and energy.

[BibT_eX]

[DOI]

Proceedings of the 46th Annual Conference on Information Sciences and Systems, 2012

Energy-delay tradeoffs in a load-balanced router.

[BibT_eX]

[DOI]

Proceedings of the 50th Annual Allerton Conference on Communication, 2012

2011

Scheduling algorithms for multicarrier wireless data systems.

[BibT_eX]

[DOI]

IEEE/ACM Trans. Netw., 2011

Energy-aware scheduling algorithms for network stability.

[BibT_eX]

[DOI]

Proceedings of the INFOCOM 2011. 30th IEEE International Conference on Computer Communications, 2011

2010

Limits of Approximation Algorithms: PCPs and Unique Games (DIMACS Tutorial Lecture Notes)

[BibT_eX]

[DOI]

CoRR, 2010

Inapproximability of Edge-Disjoint Paths and low congestion routing on undirected graphs.

[BibT_eX]

[DOI]

Comb., 2010

Routing for Energy Minimization in the Speed Scaling Model.

[BibT_eX]

[DOI]

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

Routing and Scheduling for Energy and Delay Minimization in the Powerdown Model.

[BibT_eX]

[DOI]

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

Minimum-Cost Network Design with (Dis)economies of Scale.

[BibT_eX]

[DOI]

Proceedings of the 51th Annual IEEE Symposium on Foundations of Computer Science, 2010

2009

A note on generalized rank aggregation.

[BibT_eX]

[DOI]

Hadas Shachnai

Tomomi Matsui

Inf. Process. Lett., 2009

Approximation Algorithms for Grooming in Optical Network Design.

[BibT_eX]

[DOI]

Proceedings of the INFOCOM 2009. 28th IEEE International Conference on Computer Communications, 2009

Multiserver Scheduling with Contiguity Constraints.

[BibT_eX]

[DOI]

Proceedings of the INFOCOM 2009. 28th IEEE International Conference on Computer Communications, 2009

2008

Exact algorithms for the master ring problem.

[BibT_eX]

[DOI]

Hadas Shachnai

Tomomi Matsui

Networks, 2008

Almost-tight hardness of directed congestion minimization.

[BibT_eX]

[DOI]

J. ACM, 2008

Approximation Algorithms for Scheduling Real-Time Multicast Flows in Wireless LANs.

[BibT_eX]

[DOI]

Proceedings of the INFOCOM 2008. 27th IEEE International Conference on Computer Communications, 2008

Creating Templates to Achieve Low Delay in Multi-Carrier Frame-Based Wireless Data Systems.

[BibT_eX]

[DOI]

Proceedings of the INFOCOM 2008. 27th IEEE International Conference on Computer Communications, 2008

Satisfying Arbitrary Delay Requirements in Multihop Networks.

[BibT_eX]

[DOI]

Proceedings of the INFOCOM 2008. 27th IEEE International Conference on Computer Communications, 2008

2007

Scheduling algorithms for multi-carrier wireless data systems.

[BibT_eX]

[DOI]

Proceedings of the 13th Annual International Conference on Mobile Computing and Networking, 2007

Heuristics for Fiber Installation in Optical Network Optimization.

[BibT_eX]

[DOI]

Proceedings of the Global Communications Conference, 2007

Buy-at-Bulk Network Design with Protection.

[BibT_eX]

[DOI]

Chandra Chekuri

F. Bruce Shepherd

Proceedings of the 48th Annual IEEE Symposium on Foundations of Computer Science, 2007

2006

Scheduling over nonstationary wireless channels with finite rate sets.

[BibT_eX]

[DOI]

IEEE/ACM Trans. Netw., 2006

Minimizing maximum fiber requirement in optical networks.

[BibT_eX]

[DOI]

J. Comput. Syst. Sci., 2006

Logarithmic hardness of the undirected edge-disjoint paths problem.

[BibT_eX]

[DOI]

J. ACM, 2006

Design tools for transparent optical networks.

[BibT_eX]

[DOI]

Bell Labs Tech. J., 2006

Admission control for multihop wireless backhaul networks with QoS support.

[BibT_eX]

[DOI]

Proceedings of the IEEE Wireless Communications and Networking Conference, 2006

Logarithmic hardness of the directed congestion minimization problem.

[BibT_eX]

[DOI]

Proceedings of the 38th Annual ACM Symposium on Theory of Computing, 2006

Designing Multihop Wireless Backhaul Networks with Delay Guarantees.

[BibT_eX]

[DOI]

Girija J. Narlikar

Gordon T. Wilfong

Proceedings of the INFOCOM 2006. 25th IEEE International Conference on Computer Communications, 2006

Complexity of Wavelength Assignment in Optical Network Optimization.

[BibT_eX]

[DOI]

Proceedings of the INFOCOM 2006. 25th IEEE International Conference on Computer Communications, 2006

2005

The new paradigm for wireless network optimization: a synergy of automated processes and human intervention.

[BibT_eX]

[DOI]

George E. Rittenhouse

IEEE Commun. Mag., 2005

Hardness of the undirected congestion minimization problem.

[BibT_eX]

[DOI]

Proceedings of the 37th Annual ACM Symposium on Theory of Computing, 2005

Hardness of the undirected edge-disjoint paths problem.

[BibT_eX]

[DOI]

Proceedings of the 37th Annual ACM Symposium on Theory of Computing, 2005

Bounds on fiber minimization in optical networks with fixed fiber capacity.

[BibT_eX]

[DOI]

Proceedings of the INFOCOM 2005. 24th Annual Joint Conference of the IEEE Computer and Communications Societies, 2005

Hardness of the Undirected Edge-Disjoint Paths Problem with Congestion.

[BibT_eX]

[DOI]

Proceedings of the 46th Annual IEEE Symposium on Foundations of Computer Science, 2005

2004

Routing and scheduling in multihop wireless networks with time-varying channels.

[BibT_eX]

[DOI]

Proceedings of the Fifteenth Annual ACM-SIAM Symposium on Discrete Algorithms, 2004

Scheduling over non-stationary wireless channels with finite rate sets.

[BibT_eX]

[DOI]

Proceedings of the Proceedings IEEE INFOCOM 2004, 2004

Wavelength Assignment in Optical Networks with Fixed Fiber Capacity.

[BibT_eX]

[DOI]

Proceedings of the Automata, Languages and Programming: 31st International Colloquium, 2004

Path Decomposition Under a New Cost Measure with Applications to Optical Network Design.

[BibT_eX]

[DOI]

Elliot Anshelevich

Proceedings of the Algorithms, 2004

2003

Wavelength assignment and generalized interval graph coloring.

[BibT_eX]

[DOI]

Peter Winkler

Proceedings of the Fourteenth Annual ACM-SIAM Symposium on Discrete Algorithms, 2003

2002

An improved FPTAS for Restricted Shortest Path.

[BibT_eX]

[DOI]

Funda Ergün

Rakesh K. Sinha

Inf. Process. Lett., 2002

Approximation Algorithms for Access Network Design.

[BibT_eX]

[DOI]

Algorithmica, 2002

New Algorithms for Disk Scheduling.

[BibT_eX]

[DOI]

Michael A. Bender

Algorithmica, 2002

Scheduling protocols for switches with large envelopes.

[BibT_eX]

[DOI]

Proceedings of the Thirteenth Annual ACM-SIAM Symposium on Discrete Algorithms, 2002

Scheduling Over a Time-Varying User-Dependent Channel with Applications to High Speed Wireless Data.

[BibT_eX]

[DOI]

Proceedings of the 43rd Symposium on Foundations of Computer Science, 2002

2001

A cycle augmentation algorithm for minimum cost multicommodity flows on a ring.

[BibT_eX]

[DOI]

F. Bruce Shepherd

Discret. Appl. Math., 2001

Achieving Stability in Networks of Input-Queued Switches.

[BibT_eX]

[DOI]

Proceedings of the Proceedings IEEE INFOCOM 2001, 2001

Source Routing and Scheduling in Packet Networks.

[BibT_eX]

[DOI]

Proceedings of the 42nd Annual Symposium on Foundations of Computer Science, 2001

2000

General Dynamic Routing with Per-Packet Delay Guarantees of <i>O</i>(Distance + 1/Session Rate).

[BibT_eX]

[DOI]

Antonio Fernández

Mor Harchol-Balter

SIAM J. Comput., 2000

The effects of temporary sessions on network performance.

[BibT_eX]

[DOI]

Proceedings of the Eleventh Annual ACM-SIAM Symposium on Discrete Algorithms, 2000

QoS Routing with Performance-Dependent Costs.

[BibT_eX]

[DOI]

Funda Ergün

Rakesh K. Sinha

Proceedings of the Proceedings IEEE INFOCOM 2000, 2000

Blocking probability estimates in a partitioned sector TDMA system.

[BibT_eX]

[DOI]

Proceedings of the 4th International Workshop on Discrete Algorithms and Methods for Mobile Computing and Communications (DIAL-M 2000), 2000

1999

Automatic Methods for Hiding Latency in Parallel and Distributed Computation.

[BibT_eX]

[DOI]

Panagiotis Takis Metaxas

SIAM J. Comput., 1999

Packet Routing with Arbitrary End-to-End Delay Requirements.

[BibT_eX]

[DOI]

Proceedings of the Thirty-First Annual ACM Symposium on Theory of Computing, 1999

Fast, Fair, and Frugal Bandwidth Allocation in ATM Networks.

[BibT_eX]

[DOI]

Proceedings of the Tenth Annual ACM-SIAM Symposium on Discrete Algorithms, 1999

Minimizing End-to-End Delay in High-Speed Networks with a Simple Coordinated Schedule.

[BibT_eX]

[DOI]

Proceedings of the Proceedings IEEE INFOCOM '99, 1999

1998

Stability Results for Networks with Input and Output Blocking.

[BibT_eX]

[DOI]

Proceedings of the Thirtieth Annual ACM Symposium on the Theory of Computing, 1998

The Access Network Design Problem.

[BibT_eX]

[DOI]

Proceedings of the 39th Annual Symposium on Foundations of Computer Science, 1998

1997

General Dynamic Routing with Per-Packet Delay Guarantees of O(distance + 1 / session rate).

[BibT_eX]

[DOI]

Antonio Fernández

Mor Harchol-Balter

Proceedings of the 38th Annual Symposium on Foundations of Computer Science, 1997

1996

Automatic Methods for Hiding Latency in High Bandwidth Networks (Extended Abstract).

[BibT_eX]

[DOI]

Panagiotis Takis Metaxas

Proceedings of the Twenty-Eighth Annual ACM Symposium on the Theory of Computing, 1996

Efficient Execution of Nondeterministic Parallel Programs on Asynchronous Systems.

[BibT_eX]

[DOI]

Yonatan Aumann

Michael A. Bender

Proceedings of the 8th Annual ACM Symposium on Parallel Algorithms and Architectures, 1996

Improved Methods for Hiding Latency in High Bandwidth Networks (Extended Abstract).

[BibT_eX]

[DOI]

Panagiotis Takis Metaxas

Proceedings of the 8th Annual ACM Symposium on Parallel Algorithms and Architectures, 1996

New Algorithms for the Disk Scheduling Problem.

[BibT_eX]

[DOI]

Michael A. Bender

Proceedings of the 37th Annual Symposium on Foundations of Computer Science, 1996

Improved Bounds for On-line Load Balancing.

[BibT_eX]

[DOI]

Michel X. Goemans