The following pages link to K. Subramani and Vahan Mkrtchyan (Q591313):
Displayed 50 items.
- Fast algorithms for the undirected negative cost cycle detection problem (Q261362) (← links)
- Corrigendum to: ``On the negative cost girth problem in planar networks'' (Q350729) (← links)
- Nonpreemptive coordination mechanisms for identical machines (Q372964) (← links)
- On the complexity of quantified linear systems (Q391791) (← links)
- A complexity perspective on entailment of parameterized linear constraints (Q487646) (← links)
- Analyzing restricted fragments of the theory of linear arithmetic (Q513354) (← links)
- A combinatorial certifying algorithm for linear feasibility in UTVPI constraints (Q527418) (← links)
- A mechanical verification of the stressing algorithm for negative cost cycle detection in networks (Q532429) (← links)
- Two-level heaps: a new priority queue structure with applications to the single source shortest path problem (Q607658) (← links)
- Approximating some network design problems with node costs (Q638508) (← links)
- Item:Q591313 (redirect page) (← links)
- Item:Q696998 (redirect page) (← links)
- Analysis and simulation of mixed-technology VLSI systems (Q696999) (← links)
- On approximating optimal weight ``no''-certificates in weighted difference constraint systems (Q721917) (← links)
- Optimal length tree-like refutations of linear feasibility in UTVPI constraints (Q777309) (← links)
- Tractable fragments of Presburger arithmetic (Q814932) (← links)
- Algorithmic analysis of priority-based bin packing (Q831745) (← links)
- On the copy complexity of width 3 Horn constraint systems (Q831922) (← links)
- Optimal length resolution refutations of difference constraint systems (Q846163) (← links)
- Space-time tradeoffs in negative cycle detection - an empirical analysis of the stressing algorithm (Q846471) (← links)
- On using priced timed automata to achieve optimal scheduling (Q853729) (← links)
- An approximation algorithm for state minimization in 2-MDFAs (Q855011) (← links)
- Erratum: An analysis of totally clairvoyant scheduling (Q880523) (← links)
- On the negative cost girth problem in planar networks (Q891820) (← links)
- On the design and implementation of a shared memory dispatcher for partially clairvoyant schedulers (Q941829) (← links)
- Partially clairvoyant scheduling for aggregate constraints (Q955437) (← links)
- A faster algorithm for the single source shortest path problem with few distinct positive lengths (Q972360) (← links)
- Random walks for selected Boolean implication and equivalence problems (Q1014275) (← links)
- On the complexities of selected satisfiability and equivalence queries over Boolean formulas and inclusion queries over hulls (Q1040040) (← links)
- An analysis of partially Clairvoyant scheduling (Q1405819) (← links)
- Finding minimum stopping and trapping sets: an integer linear programming approach (Q1661914) (← links)
- Randomized algorithms for finding the shortest negative cost cycle in networks (Q1693163) (← links)
- A certifying algorithm for lattice point feasibility in a system of UTVPI constraints (Q1702822) (← links)
- One-sided weak dominance drawing (Q1711831) (← links)
- Finding read-once resolution refutations in systems of 2CNF clauses (Q1749535) (← links)
- Improved algorithms for optimal length resolution refutation in difference constraint systems (Q1941901) (← links)
- Linear time-dependent constraints programming with MSVL (Q2015809) (← links)
- Analyzing clustering and partitioning problems in selected VLSI models (Q2032285) (← links)
- Analyzing unit read-once refutations in difference constraint systems (Q2055789) (← links)
- Parameterized and exact algorithms for finding a read-once resolution refutation in 2CNF formulas (Q2075363) (← links)
- On the complexity of and solutions to the minimum stopping and trapping set problems (Q2143118) (← links)
- Exact and parameterized algorithms for read-once refutations in Horn constraint systems (Q2151419) (← links)
- Analyzing the reachability problem in choice networks (Q2170221) (← links)
- Restricted cutting plane proofs in Horn constraint systems (Q2180223) (← links)
- Universal stability in multi-hop radio networks (Q2194858) (← links)
- Analyzing fractional Horn constraint systems (Q2205946) (← links)
- On finding shortest paths in arc-dependent networks (Q2225067) (← links)
- Tree-like unit refutations in Horn constraint systems (Q2232285) (← links)
- Polynomial time algorithms for optimal length tree-like refutations of linear infeasibility in UTVPI constraints (Q2235285) (← links)
- Copy complexity of Horn formulas with respect to unit read-once resolution (Q2235734) (← links)
- On quantified linear implications (Q2254606) (← links)