| * | 2009 |
|---|
| 124 | EE | Keith R. Bisset,
Jiangzhuo Chen,
Xizhou Feng,
V. S. Anil Kumar,
Madhav V. Marathe:
EpiFast: a fast algorithm for large scale realistic epidemic simulations on distributed memory systems.
ICS 2009: 430-439 |
| 123 | EE | Karthik Channakeshava,
Deepti Chafekar,
Keith R. Bisset,
V. S. Anil Kumar,
Madhav V. Marathe:
EpiNet: a simulation framework to study the spread of malware in wireless networks.
SimuTools 2009: 6 |
| 122 | EE | V. S. Anil Kumar,
Madhav V. Marathe,
Srinivasan Parthasarathy,
Aravind Srinivasan:
Scheduling on Unrelated Machines under Tree-Like Precedence Constraints.
Algorithmica 55(1): 205-226 (2009) |
| 121 | EE | V. S. Anil Kumar,
Madhav V. Marathe,
Srinivasan Parthasarathy,
Aravind Srinivasan:
A unified approach to scheduling on unrelated parallel machines.
J. ACM 56(5): (2009) |
| 2008 |
|---|
| 120 | | Christopher L. Barrett,
Stephen Eubank,
Madhav V. Marathe:
An Interaction-Based Approach to Computational Epidemiology.
AAAI 2008: 1590-1593 |
| 119 | EE | Christopher L. Barrett,
Keith R. Bisset,
Martin Holzer,
Goran Konjevod,
Madhav V. Marathe,
Dorothea Wagner:
Engineering Label-Constrained Shortest-Path Algorithms.
AAIM 2008: 27-37 |
| 118 | EE | Gabriel Istrate,
Madhav V. Marathe,
S. S. Ravi:
Adversarial Scheduling Analysis of Game-Theoretic Models of Norm Diffusion.
CiE 2008: 273-282 |
| 117 | EE | Deepti Chafekar,
V. S. Anil Kumar,
Madhav V. Marathe,
Srinivasan Parthasarathy:
Power Efficient Throughput Maximization in Multi-Hop Wireless Networks.
GLOBECOM 2008: 4895-4900 |
| 116 | EE | Deepti Chafekar,
Dave Levin,
V. S. Anil Kumar,
Madhav V. Marathe,
Srinivasan Parthasarathy,
Aravind Srinivasan:
Capacity of Asynchronous Random-Access Scheduling in Wireless Networks.
INFOCOM 2008: 1148-1156 |
| 115 | EE | Deepti Chafekar,
V. S. Anil Kumar,
Madhav V. Marathe,
Srinivasan Parthasarathy,
Aravind Srinivasan:
Approximation Algorithms for Computing Capacity of Wireless Networks with SINR Constraints.
INFOCOM 2008: 1166-1174 |
| 114 | EE | Christopher L. Barrett,
Keith R. Bisset,
Stephen Eubank,
Xizhou Feng,
Madhav V. Marathe:
EpiSimdemics: an efficient algorithm for simulating the spread of infectious disease over large realistic social networks.
SC 2008: 37 |
| 113 | EE | V. S. Anil Kumar,
Madhav V. Marathe,
Srinivasan Parthasarathy,
Aravind Srinivasan:
Minimum Weighted Completion Time.
Encyclopedia of Algorithms 2008 |
| 112 | EE | Christopher L. Barrett,
Stephen Eubank,
Bryan Lewis,
Madhav V. Marathe:
Pandemics, Detection and Management.
Encyclopedia of GIS 2008: 839-843 |
| 111 | EE | Gabriel Istrate,
Madhav V. Marathe,
S. S. Ravi:
Adversarial Scheduling Analysis of Game Theoretic Models of Norm Diffusion
CoRR abs/0803.2495: (2008) |
| 110 | EE | Gabriel Istrate,
Madhav V. Marathe,
S. S. Ravi:
Adversarial Scheduling in Evolutionary Game Dynamics
CoRR abs/0812.1194: (2008) |
| 109 | EE | Christopher L. Barrett,
Harry B. Hunt III,
Madhav V. Marathe,
S. S. Ravi,
Daniel J. Rosenkrantz,
Richard Edwin Stearns,
Mayur Thakur:
Errata for the paper "Predecessor existence problems for finite discrete dynamical systems" [TCS 386 (1-2) (2007) 3-37].
Theor. Comput. Sci. 395(1): 132-133 (2008) |
| 2007 |
|---|
| 108 | EE | Stephen Eubank,
V. S. Anil Kumar,
Madhav V. Marathe:
Epidemiology and Wireless Communication: Tight Analogy or Loose Metaphor?.
BIOWIRE 2007: 91-104 |
| 107 | EE | Christopher L. Barrett,
Keith R. Bisset,
Stephen Eubank,
Edward A. Fox,
Yi Ma,
Madhav V. Marathe,
Xiaoyu Zhang:
A Scalable Data Management Tool to Support Epidemiological Modeling of Large Urban Regions.
ECDL 2007: 546-548 |
| 106 | EE | Ryan W. Thomas,
Luiz A. DaSilva,
Madhav V. Marathe,
Kerry N. Wood:
Critical Design Decisions for Cognitive Networks.
ICC 2007: 3993-3998 |
| 105 | EE | Christopher L. Barrett,
Harry B. Hunt III,
Madhav V. Marathe,
S. S. Ravi,
Daniel J. Rosenkrantz,
Richard Edwin Stearns,
Mayur Thakur:
Computational Aspects of Analyzing Social Network Dynamics.
IJCAI 2007: 2268-2273 |
| 104 | EE | Deepti Chafekar,
V. S. Anil Kumar,
Madhav V. Marathe,
Srinivasan Parthasarathy,
Aravind Srinivasan:
Cross-layer latency minimization in wireless networks with SINR constraints.
MobiHoc 2007: 110-119 |
| 103 | EE | Christopher L. Barrett,
Harry B. Hunt III,
Madhav V. Marathe,
S. S. Ravi,
Daniel J. Rosenkrantz,
Richard Edwin Stearns,
Mayur Thakur:
Predecessor existence problems for finite discrete dynamical systems.
Theor. Comput. Sci. 386(1-2): 3-37 (2007) |
| 2006 |
|---|
| 102 | EE | Jiangzhuo Chen,
Ravi Sundaram,
Madhav V. Marathe,
Rajmohan Rajaraman:
The Confluent Capacity of the Internet: Congestion vs. Dilation.
ICDCS 2006: 5 |
| 101 | EE | Gabriel Istrate,
Anders Hansson,
Sunil Thulasidasan,
Madhav V. Marathe,
Christopher L. Barrett:
Semantic Compression of TCP Traces.
Networking 2006: 123-135 |
| 100 | EE | Christopher L. Barrett,
V. S. Anil Kumar,
Madhav V. Marathe,
Shripad Thite,
Gabriel Istrate:
Strong Edge Coloring for Channel Assignment in Wireless Radio Networks.
PerCom Workshops 2006: 106-110 |
| 99 | EE | Christopher L. Barrett,
Harry B. Hunt III,
Madhav V. Marathe,
S. S. Ravi,
Daniel J. Rosenkrantz,
Richard Edwin Stearns:
Complexity of reachability problems for finite discrete dynamical systems.
J. Comput. Syst. Sci. 72(8): 1317-1345 (2006) |
| 98 | EE | V. S. Anil Kumar,
Madhav V. Marathe,
Srinivasan Parthasarathy,
Aravind Srinivasan,
Sibylle Zust:
Provable algorithms for parallel generalized sweep scheduling.
J. Parallel Distrib. Comput. 66(6): 807-821 (2006) |
| 97 | EE | Chris Bailey-Kellogg,
Naren Ramakrishnan,
Madhav V. Marathe:
Spatial data mining to support pandemic preparedness.
SIGKDD Explorations 8(1): 80-82 (2006) |
| 2005 |
|---|
| 96 | EE | V. S. Anil Kumar,
Madhav V. Marathe,
Srinivasan Parthasarathy,
Aravind Srinivasan:
Scheduling on Unrelated Machines Under Tree-Like Precedence Constraints.
APPROX-RANDOM 2005: 146-157 |
| 95 | EE | V. S. Anil Kumar,
Madhav V. Marathe,
Srinivasan Parthasarathy,
Aravind Srinivasan:
Approximation Algorithms for Scheduling on Multiple Machines.
FOCS 2005: 254-263 |
| 94 | EE | V. S. Anil Kumar,
Srinivasan Parthasarathy,
Madhav V. Marathe,
Aravind Srinivasan,
Sibylle Zust:
Provable Algorithms for Parallel Sweep Scheduling on Unstructured Meshes.
IPDPS 2005 |
| 93 | EE | Christopher L. Barrett,
Stephan Eidenbenz,
Lukas Kroc,
Madhav V. Marathe,
James P. Smith:
Probabilistic multi-path vs. deterministic single-path protocols for dynamic ad-hoc network scenarios.
SAC 2005: 1166-1173 |
| 92 | EE | V. S. Anil Kumar,
Madhav V. Marathe,
Srinivasan Parthasarathy,
Aravind Srinivasan:
Algorithmic aspects of capacity in wireless networks.
SIGMETRICS 2005: 133-144 |
| 91 | EE | Errol L. Lloyd,
Rui Liu,
Madhav V. Marathe,
Ram Ramanathan,
S. S. Ravi:
Algorithmic Aspects of Topology Control Problems for Ad Hoc Networks.
MONET 10(1-2): 19-34 (2005) |
| 90 | EE | Christopher L. Barrett,
Stephan Eidenbenz,
Lukas Kroc,
Madhav V. Marathe,
James P. Smith:
Parametric Probabilistic Routing in Sensor Networks.
MONET 10(4): 529-544 (2005) |
| 2004 |
|---|
| 89 | EE | D. Charles Engelhart,
Anand Sivasubramaniam,
Christopher L. Barrett,
Madhav V. Marathe,
James P. Smith,
Monique Morin:
A Spatial Analysis of Mobility Models: Application to Wireless Ad Hoc Network Simulation.
Annual Simulation Symposium 2004: 35-42 |
| 88 | EE | V. S. Anil Kumar,
Madhav V. Marathe,
Srinivasan Parthasarathy,
Aravind Srinivasan:
End-to-end packet-scheduling in wireless ad-hoc networks.
SODA 2004: 1021-1030 |
| 87 | EE | Stephen Eubank,
V. S. Anil Kumar,
Madhav V. Marathe,
Aravind Srinivasan,
Nan Wang:
Structural and algorithmic aspects of massive social networks.
SODA 2004: 718-727 |
| 86 | EE | Madhav V. Marathe,
Alessandro Panconesi,
Larry D. Risinger Jr.:
An experimental study of a simple, distributed edge-coloring algorithm.
ACM Journal of Experimental Algorithmics 9: (2004) |
| 85 | EE | H. Balakrishnan,
Christopher L. Barrett,
V. S. Anil Kumar,
Madhav V. Marathe,
Shripad Thite:
The distance-2 matching problem and its relationship to the MAC-Layer capacity of ad hoc wireless networks.
IEEE Journal on Selected Areas in Communications 22(6): 1069-1079 (2004) |
| 84 | EE | Goran Konjevod,
Sven Oliver Krumke,
Madhav V. Marathe:
Budget constrained minimum cost connected medians.
J. Discrete Algorithms 2(4): 453-469 (2004) |
| 83 | EE | Christopher L. Barrett,
Madhav V. Marathe,
D. Charles Engelhart,
Anand Sivasubramaniam:
Approximating the connectivity between nodes when simulating large-scale mobile ad hoc radio networks.
Journal of Systems and Software 73: 63-74 (2004) |
| 82 | EE | Christopher L. Barrett,
Martin Drozda,
Madhav V. Marathe,
S. S. Ravi,
James P. Smith:
A mobility and traffic generation framework for modeling and simulating ad hoc communication networks.
Scientific Programming 12(1): 1-23 (2004) |
| 2003 |
|---|
| 81 | EE | Sven Oliver Krumke,
Rui Liu,
Errol L. Lloyd,
Madhav V. Marathe,
Ram Ramanathan,
S. S. Ravi:
Topology Control Problems under Symmetric and Asymmetric Power Thresholds.
ADHOC-NOW 2003: 187-198 |
| 80 | EE | Christopher L. Barrett,
Madhav V. Marathe,
D. Charles Engelhart,
Anand Sivasubramaniam:
Approximate Connectivity Graph Generation in Mobile Ad Hoc Radio Networks.
Annual Simulation Symposium 2003: 81-88 |
| 79 | EE | Christopher L. Barrett,
Harry B. Hunt III,
Madhav V. Marathe,
S. S. Ravi,
Daniel J. Rosenkrantz,
Richard Edwin Stearns:
Predecessor and Permutation Existence Problems for Sequential Dynamical Systems.
DMCS 2003: 69-80 |
| 78 | EE | Christopher L. Barrett,
Stephan Eidenbenz,
Lukas Kroc,
Madhav V. Marathe,
James P. Smith:
Parametric probabilistic sensor network routing.
Wireless Sensor Networks and Applications 2003: 122-131 |
| 77 | EE | Christopher L. Barrett,
Achla Marathe,
Madhav V. Marathe,
Doug Cook,
Gregory Hicks,
Vance Faber,
Aravind Srinivasan,
Yoram J. Sussmann,
Heidi Thornquist:
Statistical Analysis of Algorithms: A Case Study of Market-Clearing Mechanisms in the Power Industry.
J. Graph Algorithms Appl. 7(1): 3-31 (2003) |
| 76 | EE | Christopher L. Barrett,
Harry B. Hunt III,
Madhav V. Marathe,
S. S. Ravi,
Daniel J. Rosenkrantz,
Richard Edwin Stearns:
Reachability problems for sequential dynamical systems with threshold functions.
Theor. Comput. Sci. 295: 41-64 (2003) |
| 2002 |
|---|
| 75 | EE | Christopher L. Barrett,
Keith R. Bisset,
Riko Jacob,
Goran Konjevod,
Madhav V. Marathe:
Classical and Contemporary Shortest Path Problems in Road Networks: Implementation and Experimental Analysis of the TRANSIMS Router.
ESA 2002: 126-138 |
| 74 | EE | Madhav V. Marathe:
Towards a Predictive Computational Complexity Theory.
ICALP 2002: 22-31 |
| 73 | EE | V. S. Anil Kumar,
Madhav V. Marathe:
Improved Results for Stackelberg Scheduling Strategies.
ICALP 2002: 776-787 |
| 72 | EE | Christopher L. Barrett,
Madhav V. Marathe,
D. Charles Engelhart,
Anand Sivasubramaniam:
Analyzing the Short-Term Fairness of IEEE 802.11 in Wireless Multi-Hop Radio Networks.
MASCOTS 2002: 137-144 |
| 71 | EE | Errol L. Lloyd,
Rui Liu,
Madhav V. Marathe,
Ram Ramanathan,
S. S. Ravi:
Algorithmic aspects of topology control problems for ad hoc networks.
MobiHoc 2002: 123-134 |
| 70 | EE | Christopher L. Barrett,
Achla Marathe,
Madhav V. Marathe,
Martin Drozda:
Characterizing the interaction between routing and MAC protocols in ad-hoc networks.
MobiHoc 2002: 92-103 |
| 69 | EE | Christopher L. Barrett,
Madhav V. Marathe,
James P. Smith,
S. S. Ravi:
A mobility and traffic generation framework for modeling and simulating ad hoc communication networks.
SAC 2002: 122-126 |
| 68 | EE | Sven Oliver Krumke,
Madhav V. Marathe,
Diana Poensgen,
S. S. Ravi,
Hans-Christoph Wirth:
Budgeted Maximum Graph Coverage.
WG 2002: 321-332 |
| 67 | EE | Madhav V. Marathe:
Routing in Very Large Multi-Modal Time Dependent Networks: Theory and Practice (Invited Talk).
Electr. Notes Theor. Comput. Sci. 66(6): (2002) |
| 66 | EE | Harry B. Hunt III,
Madhav V. Marathe,
Venkatesh Radhakrishnan,
S. S. Ravi,
Daniel J. Rosenkrantz,
Richard Edwin Stearns:
Parallel Approximation Schemes for a Class of Planar and Near Planar Combinatorial Optimization Problems.
Inf. Comput. 173(1): 40-63 (2002) |
| 65 | | Srinivas Doddi,
Madhav V. Marathe,
Bernard M. E. Moret:
Point Set Labeling with Specified Positions.
Int. J. Comput. Geometry Appl. 12(1-2): 29-66 (2002) |
| 2001 |
|---|
| 64 | EE | Christopher L. Barrett,
Doug Cook,
Gregory Hicks,
Vance Faber,
Achla Marathe,
Madhav V. Marathe,
Aravind Srinivasan,
Yoram J. Sussmann,
Heidi Thornquist:
Experimental Analysis of Algorithms for Bilateral-Contract Clearing Mechanisms Arising in Deregulated Power Industry.
Algorithm Engineering 2001: 172-184 |
| 63 | EE | Christopher L. Barrett,
Harry B. Hunt III,
Madhav V. Marathe,
S. S. Ravi,
Daniel J. Rosenkrantz,
Richard Edwin Stearns,
Predrag T. Tosic:
Gardens of Eden and Fixed Points in Sequential Dynamical Systems.
DM-CCG 2001: 95-110 |
| 62 | EE | Harry B. Hunt III,
Madhav V. Marathe,
Richard Edwin Stearns:
Strongly-local reductions and the complexity/efficient approximability of algebra and optimization on abstract algebraic structures.
ISSAC 2001: 183-191 |
| 61 | EE | Christopher L. Barrett,
Harry B. Hunt III,
Madhav V. Marathe,
S. S. Ravi,
Daniel J. Rosenkrantz,
Richard Edwin Stearns:
Analysis Problems for Sequential Dynamical Systems and Communicating State Machines.
MFCS 2001: 159-172 |
| 60 | EE | Gabriel Istrate,
Madhav V. Marathe,
S. S. Ravi:
Adversarial models in evolutionary game dynamics.
SODA 2001: 719-720 |
| 59 | EE | R. Ravi,
Madhav V. Marathe,
S. S. Ravi,
Daniel J. Rosenkrantz,
Harry B. Hunt III:
Approximation Algorithms for Degree-Constrained Minimum-Cost Network-Design Problems.
Algorithmica 31(1): 58-78 (2001) |
| 58 | | Sven Oliver Krumke,
Madhav V. Marathe,
Hartmut Noltemeier,
S. S. Ravi,
Hans-Christoph Wirth:
Upgrading bottleneck constrained forests.
Discrete Applied Mathematics 108(1-2): 129-142 (2001) |
| 57 | EE | Harry B. Hunt III,
Madhav V. Marathe,
Richard Edwin Stearns:
Complexity and Approximability of Quantified and Stochastic Constraint Satisfaction Problems.
Electronic Notes in Discrete Mathematics 9: 217-230 (2001) |
| 56 | EE | Srinivasa Rao Arikati,
Anders Dessmark,
Andrzej Lingas,
Madhav V. Marathe:
Approximation algorithms for maximum two-dimensional pattern matching.
Theor. Comput. Sci. 255(1-2): 51-62 (2001) |
| 55 | | Sven Oliver Krumke,
Madhav V. Marathe,
S. S. Ravi:
Models and Approximation Algorithms for Channel Assignment in Radio Networks.
Wireless Networks 7(6): 575-584 (2001) |
| 2000 |
|---|
| 54 | EE | Robert D. Carr,
Srinivas Doddi,
Goran Konjevod,
Madhav V. Marathe:
On the red-blue set cover problem.
SODA 2000: 345-353 |
| 53 | EE | Éva Czabarka,
Goran Konjevod,
Madhav V. Marathe,
Allon G. Percus,
David C. Torney:
Algorithms for optimizing production DNA sequencing.
SODA 2000: 399-408 |
| 52 | EE | Madhav V. Marathe,
Alessandro Panconesi,
Larry D. Risinger Jr.:
An experimental study of a simple, distributed edge coloring algorithm.
SPAA 2000: 166-175 |
| 51 | EE | Srinivas Doddi,
Madhav V. Marathe,
S. S. Ravi,
David Scot Taylor,
Peter Widmayer:
Approximation Algorithms for Clustering to Minimize the Sum of Diameters.
SWAT 2000: 237-250 |
| 50 | EE | Srinivas Doddi,
Madhav V. Marathe,
Bernard M. E. Moret:
Point set labeling with specified positions.
Symposium on Computational Geometry 2000: 182-190 |
| 49 | EE | Goran Konjevod,
Sven Oliver Krumke,
Madhav V. Marathe:
Budget Constrained Minimum Cost Connected Medians.
WG 2000: 267-278 |
| 48 | | Srinivas Doddi,
Madhav V. Marathe,
S. S. Ravi,
David Scot Taylor,
Peter Widmayer:
Approximation Algorithms for Clustering to Minimize the Sum of Diameters.
Nord. J. Comput. 7(3): 185-203 (2000) |
| 47 | EE | Christopher L. Barrett,
Riko Jacob,
Madhav V. Marathe:
Formal-Language-Constrained Path Problems.
SIAM J. Comput. 30(3): 809-837 (2000) |
| 1999 |
|---|
| 46 | | Federico Bassetti,
Kei Davis,
Madhav V. Marathe,
Daniel J. Quinlan,
Bobby Philip:
Improving Cache Utilization of Linear Relaxation Methods: Theory and Practice.
ISCOPE 1999: 25-36 |
| 45 | EE | Riko Jacob,
Madhav V. Marathe,
Kai Nagel:
A Computational Study of Routing Algorithms for Realistic Transportation Networks.
ACM Journal of Experimental Algorithmics 4: 6 (1999) |
| 44 | | Sven Oliver Krumke,
Madhav V. Marathe,
Hartmut Noltemeier,
R. Ravi,
S. S. Ravi,
Ravi Sundaram,
Hans-Christoph Wirth:
Improving Minimum Cost Spanning Trees by Upgrading Nodes.
J. Algorithms 33(1): 92-111 (1999) |
| 43 | EE | Sven Oliver Krumke,
Hartmut Noltemeier,
Madhav V. Marathe,
R. Ravi,
S. S. Ravi,
Ravi Sundaram,
Hans-Christoph Wirth:
Improving Spanning Trees by Upgrading Nodes.
Theor. Comput. Sci. 221(1-2): 139-155 (1999) |
| 1998 |
|---|
| 42 | | Riko Jacob,
Madhav V. Marathe,
Kai Nagel:
A Computational Study of Routing Algorithms for Realistic Transportation Networks.
Algorithm Engineering 1998: 167-178 |
| 41 | EE | Doug Cook,
Vance Faber,
Madhav V. Marathe,
Aravind Srinivasan,
Yoram J. Sussmann:
Low-Bandwidth Routing and Electrical Power Networks.
ICALP 1998: 604-615 |
| 40 | EE | Madhav V. Marathe,
Harry B. Hunt III,
Daniel J. Rosenkrantz,
Richard Edwin Stearns:
Theory of Periodically Specified Problems: Complexity and Approximability.
IEEE Conference on Computational Complexity 1998: 106- |
| 39 | EE | Christopher L. Barrett,
Riko Jacob,
Madhav V. Marathe:
Formal Language Constrained Path Problems.
SWAT 1998: 234-245 |
| 38 | EE | Sven Oliver Krumke,
Madhav V. Marathe,
Hartmut Noltemeier,
S. S. Ravi,
Hans-Christoph Wirth:
Upgrading Bottleneck Constrained Forests.
WG 1998: 215-226 |
| 37 | EE | Harry B. Hunt III,
Madhav V. Marathe,
Venkatesh Radhakrishnan,
Richard Edwin Stearns:
The Complexity of Planar Counting Problems
CoRR cs.CC/9809017: (1998) |
| 36 | EE | Madhav V. Marathe,
Harry B. Hunt III,
Richard Edwin Stearns,
Venkatesh Radhakrishnan:
Approximation Algorithms for PSPACE-Hard Hierarchically and Periodically Specified Problems
CoRR cs.CC/9809064: (1998) |
| 35 | EE | Madhav V. Marathe,
R. Ravi,
Ravi Sundaram,
S. S. Ravi,
Daniel J. Rosenkrantz,
Harry B. Hunt III:
Bicriteria Network Design Problems
CoRR cs.CC/9809103: (1998) |
| 34 | | Harry B. Hunt III,
Madhav V. Marathe,
Venkatesh Radhakrishnan,
S. S. Ravi,
Daniel J. Rosenkrantz,
Richard Edwin Stearns:
NC-Approximation Schemes for NP- and PSPACE-Hard Problems for Geometric Graphs.
J. Algorithms 26(2): 238-274 (1998) |
| 33 | | Madhav V. Marathe,
R. Ravi,
Ravi Sundaram,
S. S. Ravi,
Daniel J. Rosenkrantz,
Harry B. Hunt III:
Bicriteria Network Design Problems.
J. Algorithms 28(1): 142-171 (1998) |
| 32 | | Sven Oliver Krumke,
Madhav V. Marathe,
Hartmut Noltemeier,
R. Ravi,
S. S. Ravi:
Approximation Algorithms for Certain Network Improvement Problems.
J. Comb. Optim. 2(3): 257-288 (1998) |
| 31 | EE | Harry B. Hunt III,
Madhav V. Marathe,
Venkatesh Radhakrishnan,
Richard Edwin Stearns:
The Complexity of Planar Counting Problems.
SIAM J. Comput. 27(4): 1142-1167 (1998) |
| 30 | EE | Madhav V. Marathe,
Harry B. Hunt III,
Richard Edwin Stearns,
Venkatesh Radhakrishnan:
Approximation Algorithms for PSPACE-Hard Hierarchically and Periodically Specified Problems.
SIAM J. Comput. 27(5): 1237-1261 (1998) |
| 29 | EE | Kay U. Drangmeister,
Sven Oliver Krumke,
Madhav V. Marathe,
Hartmut Noltemeier,
S. S. Ravi:
Modifying Edges of a Network to Obtain Short Subgraphs.
Theor. Comput. Sci. 203(1): 91-121 (1998) |
| 1997 |
|---|
| 28 | EE | Sven Oliver Krumke,
Madhav V. Marathe,
Hartmut Noltemeier,
R. Ravi,
S. S. Ravi,
Ravi Sundaram,
Hans-Christoph Wirth:
Improving Spanning Trees by Upgrading Nodes.
ICALP 1997: 281-291 |
| 27 | | Srinivas Doddi,
Madhav V. Marathe,
Andy Mirzaian,
Bernard M. E. Moret,
Binhai Zhu:
Map Labeling and Its Generalizations.
SODA 1997: 148-157 |
| 26 | EE | Madhav V. Marathe,
Venkatesh Radhakrishnan,
Harry B. Hunt III,
S. S. Ravi:
Hierarchically Specified Unit Disk Graphs.
Theor. Comput. Sci. 174(1-2): 23-65 (1997) |
| 25 | EE | Sven Oliver Krumke,
Madhav V. Marathe,
Hartmut Noltemeier,
Venkatesh Radhakrishnan,
S. S. Ravi,
Daniel J. Rosenkrantz:
Compact Location Problems.
Theor. Comput. Sci. 181(2): 379-404 (1997) |
| 1996 |
|---|
| 24 | | Srinivasa Rao Arikati,
Anders Dessmark,
Andrzej Lingas,
Madhav V. Marathe:
Approximation Algorithms for Maximum Two-Dimensional Pattern Matching.
CPM 1996: 348-360 |
| 23 | EE | Madhav V. Marathe,
R. Ravi,
Ravi Sundaram:
Service-Constrained Network Design Problems.
SWAT 1996: 28-40 |
| 22 | EE | Sven Oliver Krumke,
Hartmut Noltemeier,
Madhav V. Marathe,
S. S. Ravi,
Kay U. Drangmeister:
Modifying Networks to Obtain Low Cost Trees.
WG 1996: 293-307 |
| 21 | EE | Madhav V. Marathe,
Harry B. Hunt III,
S. S. Ravi:
Efficient Approximation Algorithms for Domatic Partition and on-line Coloring of Circular Arc Graphs.
Discrete Applied Mathematics 64(2): 135-149 (1996) |
| 20 | EE | Madhav V. Marathe,
S. S. Ravi:
On Approximation Algorithms for the Minimum Satisfiability Problem.
Inf. Process. Lett. 58(1): 23-29 (1996) |
| 19 | | Madhav V. Marathe,
R. Ravi,
Ravi Sundaram:
Service-Constrained Network Design Problems.
Nord. J. Comput. 3(4): 367-387 (1996) |
| 18 | EE | R. Ravi,
Ravi Sundaram,
Madhav V. Marathe,
Daniel J. Rosenkrantz,
S. S. Ravi:
Spanning Trees - Short or Small.
SIAM J. Discrete Math. 9(2): 178-200 (1996) |
| 1995 |
|---|
| 17 | | Sven Oliver Krumke,
Hartmut Noltemeier,
S. S. Ravi,
Madhav V. Marathe:
Compact Location Problems with Budget and Communication Constraints.
COCOON 1995: 510-519 |
| 16 | EE | Madhav V. Marathe,
R. Ravi,
Ravi Sundaram,
S. S. Ravi,
Daniel J. Rosenkrantz,
Harry B. Hunt III:
Bicriteria Network Design Problems.
ICALP 1995: 487-498 |
| 15 | EE | Sven Oliver Krumke,
Hartmut Noltemeier,
S. S. Ravi,
Madhav V. Marathe:
Complexity and Approximability of Certain Bicriteria Location Problems.
WG 1995: 73-87 |
| 1994 |
|---|
| 14 | EE | Harry B. Hunt III,
Madhav V. Marathe,
Venkatesh Radhakrishnan,
S. S. Ravi,
Daniel J. Rosenkrantz,
Richard Edwin Stearns:
A Unified Approach to Approximation Schemes for NP- and PSPACE-Hard Problems for Geometric Graphs.
ESA 1994: 424-435 |
| 13 | EE | Harry B. Hunt III,
Madhav V. Marathe,
Venkatesh Radhakrishnan,
S. S. Ravi,
Daniel J. Rosenkrantz,
Richard Edwin Stearns:
Approximation Schemes Using L-Reductions.
FSTTCS 1994: 342-353 |
| 12 | | R. Ravi,
Ravi Sundaram,
Madhav V. Marathe,
Daniel J. Rosenkrantz,
S. S. Ravi:
Spanning Trees Short or Small.
SODA 1994: 546-555 |
| 11 | EE | Madhav V. Marathe,
Harry B. Hunt III,
Richard Edwin Stearns,
Venkatesh Radhakrishnan:
Approximation schemes for PSPACE-complete problems for succinct specifications (preliminary version).
STOC 1994: 468-477 |
| 10 | | Harry B. Hunt III,
Madhav V. Marathe,
Richard Edwin Stearns:
Generalized CNF Satisfiability Problems and Non-Efficient.
Structure in Complexity Theory Conference 1994: 356-366 |
| 9 | | Madhav V. Marathe,
Harry B. Hunt III,
S. S. Ravi:
The Complexity of Approximation PSPACE-Complete Problems for Hierarchical Specifications.
Nord. J. Comput. 1(3): 275-316 (1994) |
| 1993 |
|---|
| 8 | EE | Venkatesh Radhakrishnan,
Sven Oliver Krumke,
Madhav V. Marathe,
Daniel J. Rosenkrantz,
S. S. Ravi:
Compact Location Problems.
FSTTCS 1993: 238-247 |
| 7 | EE | Madhav V. Marathe,
Harry B. Hunt III,
S. S. Ravi:
The Complexity of Approximating PSPACE-Complete Problems for Hierarchical Specifications (Extended Abstract).
ICALP 1993: 76-87 |
| 6 | | Madhav V. Marathe,
Harry B. Hunt III,
S. S. Ravi:
Efficient Approximation Algorithms for Domatic Partition and On-Line Coloring of Circular Arc Graphs.
ICCI 1993: 26-30 |
| 5 | EE | R. Ravi,
Madhav V. Marathe,
S. S. Ravi,
Daniel J. Rosenkrantz,
Harry B. Hunt III:
Many birds with one stone: multi-objective approximation algorithms.
STOC 1993: 438-447 |
| 4 | EE | Madhav V. Marathe,
Venkatesh Radhakrishnan,
Harry B. Hunt III,
S. S. Ravi:
Hierarchical Specified Unit Disk Graphs (Extended Abstract).
WG 1993: 21-32 |
| 1992 |
|---|
| 3 | EE | Madhav V. Marathe,
R. Ravi,
C. Pandu Rangan:
Generalized Vertex Covering in Interval Graphs.
Discrete Applied Mathematics 39(1): 87-93 (1992) |
| 1981 |
|---|
| 2 | | Madhav V. Marathe,
Sujit Kumar:
Analytical Models for an Ethernet-Like Local Area Network Link.
SIGMETRICS 1981: 205-215 |
| 1977 |
|---|
| 1 | | Madhav V. Marathe,
Samuel H. Fuller:
A Study of Multiprocessor Contention for Shared Data in C.MMP.
Int. CMG Conference 1977: 255-262 |
