The following pages link to Madhav V. Marathe (Q223031):
Displaying 50 items.
- (Q169295) (redirect page) (← links)
- Labeled cuts in graphs (Q313962) (← links)
- Modeling and analyzing social network dynamics using stochastic discrete graphical dynamical systems (Q549709) (← links)
- Complexity of reachability problems for finite discrete dynamical systems (Q856411) (← links)
- Budget constrained minimum cost connected medians (Q876728) (← links)
- Errata for the paper ``Predecessor existence problems for finite discrete dynamical systems''. (Q924687) (← links)
- Generalized vertex covering in interval graphs (Q1199467) (← links)
- Hierarchically specified unit disk graphs (Q1269904) (← links)
- Modifying edges of a network to obtain short subgraphs (Q1274323) (← links)
- Approximation algorithms for certain network improvement problems (Q1282208) (← links)
- On approximation algorithms for the minimum satisfiability problem (Q1351157) (← links)
- Compact location problems (Q1391322) (← links)
- Reachability problems for sequential dynamical systems with threshold functions. (Q1401231) (← links)
- On some special classes of sequential dynamical systems (Q1424252) (← links)
- A characterization of nested canalyzing functions with maximum average sensitivity (Q1627840) (← links)
- Inhibiting diffusion of complex contagions in social networks: theoretical and experimental results (Q1711228) (← links)
- Parallel approximation schemes for a class of planar and near planar combinatorial optimization problems. (Q1854505) (← links)
- Efficient approximation algorithms for domatic partition and on-line coloring of circular arc graphs (Q1917245) (← links)
- Improving spanning trees by upgrading nodes (Q1960523) (← links)
- Inferring local transition functions of discrete dynamical systems from observations of system behavior (Q2357112) (← links)
- Scheduling on unrelated machines under tree-like precedence constraints (Q2391177) (← links)
- Predecessor existence problems for finite discrete dynamical systems (Q2455591) (← links)
- Provable algorithms for parallel generalized sweep scheduling (Q2495501) (← links)
- (Q2708233) (← links)
- (Q2721983) (← links)
- (Q2741527) (← links)
- (Q2766688) (← links)
- (Q2768370) (← links)
- Approximation schemes for PSPACE-complete problems for succinct specifications (preliminary version) (Q2817638) (← links)
- Adversarial scheduling in discrete models of social dynamics (Q2919940) (← links)
- Complexity of Inferring Local Transition Functions of Discrete Dynamical Systems (Q2947406) (← links)
- Strongly-local reductions and the complexity/efficient approximability of algebra and optimization on abstract algebraic structures (Q2958929) (← links)
- (Q3128917) (← links)
- (Q3129923) (← links)
- A unified approach to scheduling on unrelated parallel machines (Q3452224) (← links)
- Adversarial Scheduling Analysis of Game-Theoretic Models of Norm Diffusion (Q3507442) (← links)
- Engineering Label-Constrained Shortest-Path Algorithms (Q3511412) (← links)
- (Q3574272) (← links)
- (Q3597159) (← links)
- An optimal algorithm to solve the all-pair shortest path problem on interval graphs (Q3989542) (← links)
- The Complexity of Planar Counting Problems (Q4210088) (← links)
- Approximation Algorithms for PSPACE-Hard Hierarchically and Periodically Specified Problems (Q4210093) (← links)
- Bicriteria Network Design Problems (Q4216149) (← links)
- (Q4232790) (← links)
- (Q4258576) (← links)
- (Q4331197) (← links)
- (Q4359752) (← links)
- (Q4375760) (← links)
- NC-Approximation Schemes for NP- and PSPACE-Hard Problems for Geometric Graphs (Q4386448) (← links)
- (Q4395331) (← links)
