The SCEAS System
Navigation Menu

Search the dblp DataBase

Title:
Author:

Madhav V. Marathe: [Publications] [Author Rank by year] [Co-authors] [Prefers] [Cites] [Cited by]

Publications of Author

  1. 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. [Citation Graph (0, 0)][DBLP]
    ADHOC-NOW, 2003, pp:187-198 [Conf]
  2. Christopher L. Barrett, Madhav V. Marathe, D. Charles Engelhart, Anand Sivasubramaniam
    Approximate Connectivity Graph Generation in Mobile Ad Hoc Radio Networks. [Citation Graph (0, 0)][DBLP]
    Annual Simulation Symposium, 2003, pp:81-88 [Conf]
  3. 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. [Citation Graph (0, 0)][DBLP]
    Annual Simulation Symposium, 2004, pp:35-42 [Conf]
  4. V. S. Anil Kumar, Madhav V. Marathe, Srinivasan Parthasarathy 0002, Aravind Srinivasan
    Scheduling on Unrelated Machines Under Tree-Like Precedence Constraints. [Citation Graph (0, 0)][DBLP]
    APPROX-RANDOM, 2005, pp:146-157 [Conf]
  5. Madhav V. Marathe, Samuel H. Fuller
    A Study of Multiprocessor Contention for Shared Data in C.MMP. [Citation Graph (0, 0)][DBLP]
    Int. CMG Conference, 1977, pp:255-262 [Conf]
  6. Harry B. Hunt III, Madhav V. Marathe, Richard Edwin Stearns
    Generalized CNF Satisfiability Problems and Non-Efficient. [Citation Graph (0, 0)][DBLP]
    Structure in Complexity Theory Conference, 1994, pp:356-366 [Conf]
  7. Madhav V. Marathe, Harry B. Hunt III, Daniel J. Rosenkrantz, Richard Edwin Stearns
    Theory of Periodically Specified Problems: Complexity and Approximability. [Citation Graph (0, 0)][DBLP]
    IEEE Conference on Computational Complexity, 1998, pp:106-0 [Conf]
  8. Sven Oliver Krumke, Hartmut Noltemeier, S. S. Ravi, Madhav V. Marathe
    Compact Location Problems with Budget and Communication Constraints. [Citation Graph (0, 0)][DBLP]
    COCOON, 1995, pp:510-519 [Conf]
  9. Srinivas Doddi, Madhav V. Marathe, Bernard M. E. Moret
    Point set labeling with specified positions. [Citation Graph (0, 0)][DBLP]
    Symposium on Computational Geometry, 2000, pp:182-190 [Conf]
  10. Srinivasa Rao Arikati, Anders Dessmark, Andrzej Lingas, Madhav V. Marathe
    Approximation Algorithms for Maximum Two-Dimensional Pattern Matching. [Citation Graph (0, 0)][DBLP]
    CPM, 1996, pp:348-360 [Conf]
  11. 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. [Citation Graph (0, 0)][DBLP]
    DM-CCG, 2001, pp:95-110 [Conf]
  12. 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. [Citation Graph (0, 0)][DBLP]
    DMCS, 2003, pp:69-80 [Conf]
  13. Christopher L. Barrett, Keith 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. [Citation Graph (0, 0)][DBLP]
    ESA, 2002, pp:126-138 [Conf]
  14. 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. [Citation Graph (0, 0)][DBLP]
    ESA, 1994, pp:424-435 [Conf]
  15. V. S. Anil Kumar, Madhav V. Marathe, Srinivasan Parthasarathy 0002, Aravind Srinivasan
    Approximation Algorithms for Scheduling on Multiple Machines. [Citation Graph (0, 0)][DBLP]
    FOCS, 2005, pp:254-263 [Conf]
  16. Harry B. Hunt III, Madhav V. Marathe, Venkatesh Radhakrishnan, S. S. Ravi, Daniel J. Rosenkrantz, Richard Edwin Stearns
    Approximation Schemes Using L-Reductions. [Citation Graph (0, 0)][DBLP]
    FSTTCS, 1994, pp:342-353 [Conf]
  17. Venkatesh Radhakrishnan, Sven Oliver Krumke, Madhav V. Marathe, Daniel J. Rosenkrantz, S. S. Ravi
    Compact Location Problems. [Citation Graph (0, 0)][DBLP]
    FSTTCS, 1993, pp:238-247 [Conf]
  18. Doug Cook, Vance Faber, Madhav V. Marathe, Aravind Srinivasan, Yoram J. Sussmann
    Low-Bandwidth Routing and Electrical Power Networks. [Citation Graph (0, 0)][DBLP]
    ICALP, 1998, pp:604-615 [Conf]
  19. Sven Oliver Krumke, Madhav V. Marathe, Hartmut Noltemeier, R. Ravi, S. S. Ravi, Ravi Sundaram, Hans-Christoph Wirth
    Improving Spanning Trees by Upgrading Nodes. [Citation Graph (0, 0)][DBLP]
    ICALP, 1997, pp:281-291 [Conf]
  20. V. S. Anil Kumar, Madhav V. Marathe
    Improved Results for Stackelberg Scheduling Strategies. [Citation Graph (0, 0)][DBLP]
    ICALP, 2002, pp:776-787 [Conf]
  21. Madhav V. Marathe
    Towards a Predictive Computational Complexity Theory. [Citation Graph (0, 0)][DBLP]
    ICALP, 2002, pp:22-31 [Conf]
  22. Madhav V. Marathe, Harry B. Hunt III, S. S. Ravi
    The Complexity of Approximating PSPACE-Complete Problems for Hierarchical Specifications (Extended Abstract). [Citation Graph (0, 0)][DBLP]
    ICALP, 1993, pp:76-87 [Conf]
  23. Madhav V. Marathe, R. Ravi, Ravi Sundaram, S. S. Ravi, Daniel J. Rosenkrantz, Harry B. Hunt III
    Bicriteria Network Design Problems. [Citation Graph (0, 0)][DBLP]
    ICALP, 1995, pp:487-498 [Conf]
  24. Madhav V. Marathe, Harry B. Hunt III, S. S. Ravi
    Efficient Approximation Algorithms for Domatic Partition and On-Line Coloring of Circular Arc Graphs. [Citation Graph (0, 0)][DBLP]
    ICCI, 1993, pp:26-30 [Conf]
  25. Jiangzhuo Chen, Ravi Sundaram, Madhav V. Marathe, Rajmohan Rajaraman
    The Confluent Capacity of the Internet: Congestion vs. Dilation. [Citation Graph (0, 0)][DBLP]
    ICDCS, 2006, pp:5- [Conf]
  26. 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. [Citation Graph (0, 0)][DBLP]
    IJCAI, 2007, pp:2268-2273 [Conf]
  27. V. S. Anil Kumar, Srinivasan Parthasarathy 0002, Madhav V. Marathe, Aravind Srinivasan, Sibylle Zust
    Provable Algorithms for Parallel Sweep Scheduling on Unstructured Meshes. [Citation Graph (0, 0)][DBLP]
    IPDPS, 2005, pp:- [Conf]
  28. Federico Bassetti, Kei Davis, Madhav V. Marathe, Daniel J. Quinlan, Bobby Philip
    Improving Cache Utilization of Linear Relaxation Methods: Theory and Practice. [Citation Graph (0, 0)][DBLP]
    ISCOPE, 1999, pp:25-36 [Conf]
  29. 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. [Citation Graph (0, 0)][DBLP]
    ISSAC, 2001, pp:183-191 [Conf]
  30. 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. [Citation Graph (0, 0)][DBLP]
    MASCOTS, 2002, pp:137-144 [Conf]
  31. 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. [Citation Graph (0, 0)][DBLP]
    MFCS, 2001, pp:159-172 [Conf]
  32. Christopher L. Barrett, Achla Marathe, Madhav V. Marathe, Martin Drozda
    Characterizing the interaction between routing and MAC protocols in ad-hoc networks. [Citation Graph (0, 0)][DBLP]
    MobiHoc, 2002, pp:92-103 [Conf]
  33. Errol L. Lloyd, Rui Liu, Madhav V. Marathe, Ram Ramanathan, S. S. Ravi
    Algorithmic aspects of topology control problems for ad hoc networks. [Citation Graph (0, 0)][DBLP]
    MobiHoc, 2002, pp:123-134 [Conf]
  34. Gabriel Istrate, Anders Hansson, Sunil Thulasidasan, Madhav V. Marathe, Christopher L. Barrett
    Semantic Compression of TCP Traces. [Citation Graph (0, 0)][DBLP]
    Networking, 2006, pp:123-135 [Conf]
  35. Christopher L. Barrett, V. S. Anil Kumar, Madhav V. Marathe, Shripad Thite, Gabriel Istrate
    Strong Edge Coloring for Channel Assignment in Wireless Radio Networks. [Citation Graph (0, 0)][DBLP]
    PerCom Workshops, 2006, pp:106-110 [Conf]
  36. 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. [Citation Graph (0, 0)][DBLP]
    SAC, 2005, pp:1166-1173 [Conf]
  37. 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. [Citation Graph (0, 0)][DBLP]
    SAC, 2002, pp:122-126 [Conf]
  38. V. S. Anil Kumar, Madhav V. Marathe, Srinivasan Parthasarathy 0002, Aravind Srinivasan
    Algorithmic aspects of capacity in wireless networks. [Citation Graph (0, 0)][DBLP]
    SIGMETRICS, 2005, pp:133-144 [Conf]
  39. Madhav V. Marathe, Sujit Kumar
    Analytical Models for an Ethernet-Like Local Area Network Link. [Citation Graph (0, 0)][DBLP]
    SIGMETRICS, 1981, pp:205-215 [Conf]
  40. Robert D. Carr, Srinivas Doddi, Goran Konjevod, Madhav V. Marathe
    On the red-blue set cover problem. [Citation Graph (0, 0)][DBLP]
    SODA, 2000, pp:345-353 [Conf]
  41. Éva Czabarka, Goran Konjevod, Madhav V. Marathe, Allon G. Percus, David C. Torney
    Algorithms for optimizing production DNA sequencing. [Citation Graph (0, 0)][DBLP]
    SODA, 2000, pp:399-408 [Conf]
  42. Srinivas Doddi, Madhav V. Marathe, Andy Mirzaian, Bernard M. E. Moret, Binhai Zhu
    Map Labeling and Its Generalizations. [Citation Graph (0, 0)][DBLP]
    SODA, 1997, pp:148-157 [Conf]
  43. Stephen Eubank, V. S. Anil Kumar, Madhav V. Marathe, Aravind Srinivasan, Nan Wang
    Structural and algorithmic aspects of massive social networks. [Citation Graph (0, 0)][DBLP]
    SODA, 2004, pp:718-727 [Conf]
  44. Gabriel Istrate, Madhav V. Marathe, S. S. Ravi
    Adversarial models in evolutionary game dynamics. [Citation Graph (0, 0)][DBLP]
    SODA, 2001, pp:719-720 [Conf]
  45. V. S. Anil Kumar, Madhav V. Marathe, Srinivasan Parthasarathy 0002, Aravind Srinivasan
    End-to-end packet-scheduling in wireless ad-hoc networks. [Citation Graph (0, 0)][DBLP]
    SODA, 2004, pp:1021-1030 [Conf]
  46. R. Ravi, Ravi Sundaram, Madhav V. Marathe, Daniel J. Rosenkrantz, S. S. Ravi
    Spanning Trees Short or Small. [Citation Graph (0, 0)][DBLP]
    SODA, 1994, pp:546-555 [Conf]
  47. Madhav V. Marathe, Alessandro Panconesi, Larry D. Risinger Jr.
    An experimental study of a simple, distributed edge coloring algorithm. [Citation Graph (0, 0)][DBLP]
    SPAA, 2000, pp:166-175 [Conf]
  48. Madhav V. Marathe, Harry B. Hunt III, Richard Edwin Stearns, Venkatesh Radhakrishnan
    Approximation schemes for PSPACE-complete problems for succinct specifications (preliminary version). [Citation Graph (0, 0)][DBLP]
    STOC, 1994, pp:468-477 [Conf]
  49. R. Ravi, Madhav V. Marathe, S. S. Ravi, Daniel J. Rosenkrantz, Harry B. Hunt III
    Many birds with one stone: multi-objective approximation algorithms. [Citation Graph (0, 0)][DBLP]
    STOC, 1993, pp:438-447 [Conf]
  50. Christopher L. Barrett, Riko Jacob, Madhav V. Marathe
    Formal Language Constrained Path Problems. [Citation Graph (0, 0)][DBLP]
    SWAT, 1998, pp:234-245 [Conf]
  51. Srinivas Doddi, Madhav V. Marathe, S. S. Ravi, David Scot Taylor, Peter Widmayer
    Approximation Algorithms for Clustering to Minimize the Sum of Diameters. [Citation Graph (0, 0)][DBLP]
    SWAT, 2000, pp:237-250 [Conf]
  52. Madhav V. Marathe, R. Ravi, Ravi Sundaram
    Service-Constrained Network Design Problems. [Citation Graph (0, 0)][DBLP]
    SWAT, 1996, pp:28-40 [Conf]
  53. 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. [Citation Graph (0, 0)][DBLP]
    Algorithm Engineering, 2001, pp:172-184 [Conf]
  54. Riko Jacob, Madhav V. Marathe, Kai Nagel
    A Computational Study of Routing Algorithms for Realistic Transportation Networks. [Citation Graph (0, 0)][DBLP]
    Algorithm Engineering, 1998, pp:167-178 [Conf]
  55. Goran Konjevod, Sven Oliver Krumke, Madhav V. Marathe
    Budget Constrained Minimum Cost Connected Medians. [Citation Graph (0, 0)][DBLP]
    WG, 2000, pp:267-278 [Conf]
  56. Sven Oliver Krumke, Madhav V. Marathe, Hartmut Noltemeier, S. S. Ravi, Hans-Christoph Wirth
    Upgrading Bottleneck Constrained Forests. [Citation Graph (0, 0)][DBLP]
    WG, 1998, pp:215-226 [Conf]
  57. Sven Oliver Krumke, Madhav V. Marathe, Diana Poensgen, S. S. Ravi, Hans-Christoph Wirth
    Budgeted Maximum Graph Coverage. [Citation Graph (0, 0)][DBLP]
    WG, 2002, pp:321-332 [Conf]
  58. Sven Oliver Krumke, Hartmut Noltemeier, Madhav V. Marathe, S. S. Ravi, Kay U. Drangmeister
    Modifying Networks to Obtain Low Cost Trees. [Citation Graph (0, 0)][DBLP]
    WG, 1996, pp:293-307 [Conf]
  59. Sven Oliver Krumke, Hartmut Noltemeier, S. S. Ravi, Madhav V. Marathe
    Complexity and Approximability of Certain Bicriteria Location Problems. [Citation Graph (0, 0)][DBLP]
    WG, 1995, pp:73-87 [Conf]
  60. Madhav V. Marathe, Venkatesh Radhakrishnan, Harry B. Hunt III, S. S. Ravi
    Hierarchical Specified Unit Disk Graphs (Extended Abstract). [Citation Graph (0, 0)][DBLP]
    WG, 1993, pp:21-32 [Conf]
  61. 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. [Citation Graph (0, 0)][DBLP]
    Algorithmica, 2001, v:31, n:1, pp:58-78 [Journal]
  62. Harry B. Hunt III, Madhav V. Marathe, Venkatesh Radhakrishnan, Richard Edwin Stearns
    The Complexity of Planar Counting Problems [Citation Graph (0, 0)][DBLP]
    CoRR, 1998, v:0, n:, pp:- [Journal]
  63. Madhav V. Marathe, Harry B. Hunt III, Richard Edwin Stearns, Venkatesh Radhakrishnan
    Approximation Algorithms for PSPACE-Hard Hierarchically and Periodically Specified Problems [Citation Graph (0, 0)][DBLP]
    CoRR, 1998, v:0, n:, pp:- [Journal]
  64. Madhav V. Marathe, R. Ravi, Ravi Sundaram, S. S. Ravi, Daniel J. Rosenkrantz, Harry B. Hunt III
    Bicriteria Network Design Problems [Citation Graph (0, 0)][DBLP]
    CoRR, 1998, v:0, n:, pp:- [Journal]
  65. Sven Oliver Krumke, Madhav V. Marathe, Hartmut Noltemeier, S. S. Ravi, Hans-Christoph Wirth
    Upgrading bottleneck constrained forests. [Citation Graph (0, 0)][DBLP]
    Discrete Applied Mathematics, 2001, v:108, n:1-2, pp:129-142 [Journal]
  66. Madhav V. Marathe, Harry B. Hunt III, S. S. Ravi
    Efficient Approximation Algorithms for Domatic Partition and on-line Coloring of Circular Arc Graphs. [Citation Graph (0, 0)][DBLP]
    Discrete Applied Mathematics, 1996, v:64, n:2, pp:135-149 [Journal]
  67. Madhav V. Marathe, R. Ravi, C. Pandu Rangan
    Generalized Vertex Covering in Interval Graphs. [Citation Graph (0, 0)][DBLP]
    Discrete Applied Mathematics, 1992, v:39, n:1, pp:87-93 [Journal]
  68. Madhav V. Marathe
    Routing in Very Large Multi-Modal Time Dependent Networks: Theory and Practice (Invited Talk). [Citation Graph (0, 0)][DBLP]
    Electr. Notes Theor. Comput. Sci., 2002, v:66, n:6, pp:- [Journal]
  69. 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. [Citation Graph (0, 0)][DBLP]
    Inf. Comput., 2002, v:173, n:1, pp:40-63 [Journal]
  70. Srinivas Doddi, Madhav V. Marathe, Bernard M. E. Moret
    Point Set Labeling with Specified Positions. [Citation Graph (0, 0)][DBLP]
    Int. J. Comput. Geometry Appl., 2002, v:12, n:1-2, pp:29-66 [Journal]
  71. Madhav V. Marathe, S. S. Ravi
    On Approximation Algorithms for the Minimum Satisfiability Problem. [Citation Graph (0, 0)][DBLP]
    Inf. Process. Lett., 1996, v:58, n:1, pp:23-29 [Journal]
  72. 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. [Citation Graph (0, 0)][DBLP]
    J. Algorithms, 1998, v:26, n:2, pp:238-274 [Journal]
  73. 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. [Citation Graph (0, 0)][DBLP]
    J. Algorithms, 1999, v:33, n:1, pp:92-111 [Journal]
  74. Madhav V. Marathe, R. Ravi, Ravi Sundaram, S. S. Ravi, Daniel J. Rosenkrantz, Harry B. Hunt III
    Bicriteria Network Design Problems. [Citation Graph (0, 0)][DBLP]
    J. Algorithms, 1998, v:28, n:1, pp:142-171 [Journal]
  75. Sven Oliver Krumke, Madhav V. Marathe, Hartmut Noltemeier, R. Ravi, S. S. Ravi
    Approximation Algorithms for Certain Network Improvement Problems. [Citation Graph (0, 0)][DBLP]
    J. Comb. Optim., 1998, v:2, n:3, pp:257-288 [Journal]
  76. 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. [Citation Graph (0, 0)][DBLP]
    J. Comput. Syst. Sci., 2006, v:72, n:8, pp:1317-1345 [Journal]
  77. Goran Konjevod, Sven Oliver Krumke, Madhav V. Marathe
    Budget constrained minimum cost connected medians. [Citation Graph (0, 0)][DBLP]
    J. Discrete Algorithms, 2004, v:2, n:4, pp:453-469 [Journal]
  78. Riko Jacob, Madhav V. Marathe, Kai Nagel
    A Computational Study of Routing Algorithms for Realistic Transportation Networks. [Citation Graph (0, 0)][DBLP]
    ACM Journal of Experimental Algorithms, 1999, v:4, n:, pp:6- [Journal]
  79. Madhav V. Marathe, Alessandro Panconesi, Larry D. Risinger Jr.
    An experimental study of a simple, distributed edge-coloring algorithm. [Citation Graph (0, 0)][DBLP]
    ACM Journal of Experimental Algorithms, 2004, v:9, n:, pp:- [Journal]
  80. 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. [Citation Graph (0, 0)][DBLP]
    J. Graph Algorithms Appl., 2003, v:7, n:1, pp:3-31 [Journal]
  81. V. S. Anil Kumar, Madhav V. Marathe, Srinivasan Parthasarathy 0002, Aravind Srinivasan, Sibylle Zust
    Provable algorithms for parallel generalized sweep scheduling. [Citation Graph (0, 0)][DBLP]
    J. Parallel Distrib. Comput., 2006, v:66, n:6, pp:807-821 [Journal]
  82. 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. [Citation Graph (0, 0)][DBLP]
    Journal of Systems and Software, 2004, v:73, n:, pp:63-74 [Journal]
  83. Christopher L. Barrett, Stephan Eidenbenz, Lukas Kroc, Madhav V. Marathe, James P. Smith
    Parametric Probabilistic Routing in Sensor Networks. [Citation Graph (0, 0)][DBLP]
    MONET, 2005, v:10, n:4, pp:529-544 [Journal]
  84. Errol L. Lloyd, Rui Liu, Madhav V. Marathe, Ram Ramanathan, S. S. Ravi
    Algorithmic Aspects of Topology Control Problems for Ad Hoc Networks. [Citation Graph (0, 0)][DBLP]
    MONET, 2005, v:10, n:1-2, pp:19-34 [Journal]
  85. Srinivas Doddi, Madhav V. Marathe, S. S. Ravi, David Scot Taylor, Peter Widmayer
    Approximation Algorithms for Clustering to Minimize the Sum of Diameters. [Citation Graph (0, 0)][DBLP]
    Nord. J. Comput., 2000, v:7, n:3, pp:185-203 [Journal]
  86. Madhav V. Marathe, Harry B. Hunt III, S. S. Ravi
    The Complexity of Approximation PSPACE-Complete Problems for Hierarchical Specifications. [Citation Graph (0, 0)][DBLP]
    Nord. J. Comput., 1994, v:1, n:3, pp:275-316 [Journal]
  87. Madhav V. Marathe, R. Ravi, Ravi Sundaram
    Service-Constrained Network Design Problems. [Citation Graph (0, 0)][DBLP]
    Nord. J. Comput., 1996, v:3, n:4, pp:367-387 [Journal]
  88. Christopher L. Barrett, Riko Jacob, Madhav V. Marathe
    Formal-Language-Constrained Path Problems. [Citation Graph (0, 0)][DBLP]
    SIAM J. Comput., 2000, v:30, n:3, pp:809-837 [Journal]
  89. Harry B. Hunt III, Madhav V. Marathe, Venkatesh Radhakrishnan, Richard Edwin Stearns
    The Complexity of Planar Counting Problems. [Citation Graph (0, 0)][DBLP]
    SIAM J. Comput., 1998, v:27, n:4, pp:1142-1167 [Journal]
  90. Madhav V. Marathe, Harry B. Hunt III, Richard Edwin Stearns, Venkatesh Radhakrishnan
    Approximation Algorithms for PSPACE-Hard Hierarchically and Periodically Specified Problems. [Citation Graph (0, 0)][DBLP]
    SIAM J. Comput., 1998, v:27, n:5, pp:1237-1261 [Journal]
  91. R. Ravi, Ravi Sundaram, Madhav V. Marathe, Daniel J. Rosenkrantz, S. S. Ravi
    Spanning Trees - Short or Small. [Citation Graph (0, 0)][DBLP]
    SIAM J. Discrete Math., 1996, v:9, n:2, pp:178-200 [Journal]
  92. Chris Bailey-Kellogg, Naren Ramakrishnan, Madhav V. Marathe
    Spatial data mining to support pandemic preparedness. [Citation Graph (0, 0)][DBLP]
    SIGKDD Explorations, 2006, v:8, n:1, pp:80-82 [Journal]
  93. 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. [Citation Graph (0, 0)][DBLP]
    Scientific Programming, 2004, v:12, n:1, pp:1-23 [Journal]
  94. Srinivasa Rao Arikati, Anders Dessmark, Andrzej Lingas, Madhav V. Marathe
    Approximation algorithms for maximum two-dimensional pattern matching. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 2001, v:255, n:1-2, pp:51-62 [Journal]
  95. 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. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 2003, v:1, n:, pp:41-64 [Journal]
  96. Kay U. Drangmeister, Sven Oliver Krumke, Madhav V. Marathe, Hartmut Noltemeier, S. S. Ravi
    Modifying Edges of a Network to Obtain Short Subgraphs. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 1998, v:203, n:1, pp:91-121 [Journal]
  97. Sven Oliver Krumke, Madhav V. Marathe, Hartmut Noltemeier, Venkatesh Radhakrishnan, S. S. Ravi, Daniel J. Rosenkrantz
    Compact Location Problems. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 1997, v:181, n:2, pp:379-404 [Journal]
  98. Sven Oliver Krumke, Hartmut Noltemeier, Madhav V. Marathe, R. Ravi, S. S. Ravi, Ravi Sundaram, Hans-Christoph Wirth
    Improving Spanning Trees by Upgrading Nodes. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 1999, v:221, n:1-2, pp:139-155 [Journal]
  99. Madhav V. Marathe, Venkatesh Radhakrishnan, Harry B. Hunt III, S. S. Ravi
    Hierarchically Specified Unit Disk Graphs. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 1997, v:174, n:1-2, pp:23-65 [Journal]
  100. Sven Oliver Krumke, Madhav V. Marathe, S. S. Ravi
    Models and Approximation Algorithms for Channel Assignment in Radio Networks. [Citation Graph (0, 0)][DBLP]
    Wireless Networks, 2001, v:7, n:6, pp:575-584 [Journal]
  101. Christopher L. Barrett, Keith 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. [Citation Graph (0, 0)][DBLP]
    ECDL, 2007, pp:546-548 [Conf]
  102. 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. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 2007, v:386, n:1-2, pp:3-37 [Journal]

  103. An Interaction-Based Approach to Computational Epidemiology. [Citation Graph (, )][DBLP]


  104. Engineering Label-Constrained Shortest-Path Algorithms. [Citation Graph (, )][DBLP]


  105. Adversarial Scheduling Analysis of Game-Theoretic Models of Norm Diffusion. [Citation Graph (, )][DBLP]


  106. Critical Design Decisions for Cognitive Networks. [Citation Graph (, )][DBLP]


  107. EpiFast: a fast algorithm for large scale realistic epidemic simulations on distributed memory systems. [Citation Graph (, )][DBLP]


  108. Indemics: an interactive data intensive framework for high performance epidemic simulation. [Citation Graph (, )][DBLP]


  109. Approximation Algorithms for Computing Capacity of Wireless Networks with SINR Constraints. [Citation Graph (, )][DBLP]


  110. Capacity of Asynchronous Random-Access Scheduling in Wireless Networks. [Citation Graph (, )][DBLP]


  111. Bi-Criteria Approximation Algorithms for Power-Efficient and Low-Interference Topology Control in Unreliable Ad Hoc Networks. [Citation Graph (, )][DBLP]


  112. Distributed Strategies for Channel Allocation and Scheduling in Software-Defined Radio Networks. [Citation Graph (, )][DBLP]


  113. Cross-layer latency minimization in wireless networks with SINR constraints. [Citation Graph (, )][DBLP]


  114. Finding Critical Nodes for Inhibiting Diffusion of Complex Contagions in Social Networks. [Citation Graph (, )][DBLP]


  115. EpiSimdemics: an efficient algorithm for simulating the spread of infectious disease over large realistic social networks. [Citation Graph (, )][DBLP]


  116. Generation and Analysis of Large Synthetic Social Contact Networks. [Citation Graph (, )][DBLP]


  117. Modeling Interaction between Individuals, Social Networks and Public Policy to Support Public Health Epidemiology. [Citation Graph (, )][DBLP]


  118. Power Efficient Throughput Maximization in Multi-Hop Wireless Networks. [Citation Graph (, )][DBLP]


  119. Parametric probabilistic sensor network routing. [Citation Graph (, )][DBLP]


  120. Epidemiology and Wireless Communication: Tight Analogy or Loose Metaphor?. [Citation Graph (, )][DBLP]


  121. EpiNet: a simulation framework to study the spread of malware in wireless networks. [Citation Graph (, )][DBLP]


  122. Beyond Degree Distributions: Local to Global Structure of Social Contact Graphs. [Citation Graph (, )][DBLP]


  123. Coevolution of Epidemics, Social Networks, and Individual Behavior: A Case Study. [Citation Graph (, )][DBLP]


  124. Scheduling on Unrelated Machines under Tree-Like Precedence Constraints. [Citation Graph (, )][DBLP]


  125. Computational Epidemiology in a Connected World. [Citation Graph (, )][DBLP]


  126. Adversarial Scheduling Analysis of Game Theoretic Models of Norm Diffusion [Citation Graph (, )][DBLP]


  127. Adversarial Scheduling in Evolutionary Game Dynamics [Citation Graph (, )][DBLP]


Search in 0.769secs, Finished in 0.776secs
NOTICE1
System may not be available sometimes or not working properly, since it is still in development with continuous upgrades
NOTICE2
The rankings that are presented on this page should NOT be considered as formal since the citation info is incomplete in DBLP
 
System created by asidirop@csd.auth.gr [http://users.auth.gr/~asidirop/] © 2002
for Data Engineering Laboratory, Department of Informatics, Aristotle University © 2002