Pascal and Francis Bibliographic Databases

Help

Search results

Your search

au.\*:("VAZIRANI, V. V")

Publication Year[py]

A-Z Z-A Frequency ↓ Frequency ↑
Export in CSV

Discipline (document) [di]

A-Z Z-A Frequency ↓ Frequency ↑
Export in CSV

Author Country

A-Z Z-A Frequency ↓ Frequency ↑
Export in CSV

Results 1 to 25 of 25

  • Page / 1
Export

Selection :

  • and

NC algorithms for computing the number of perfect matchings in K3,3-free graphs and related problemsVAZIRANI, V. V.Information and computation (Print). 1989, Vol 80, Num 2, pp 152-164, issn 0890-5401, 13 p.Article

Recent results on approximating the Steiner tree problem and its generalizationsVAZIRANI, V. V.Theoretical computer science. 2000, Vol 235, Num 1, pp 205-216, issn 0304-3975Article

A polyhedron with all s-t cuts as vertices, and adjacency of cutsGARG, N; VAZIRANI, V. V.Mathematical programming. 1995, Vol 70, Num 1, pp 17-25, issn 0025-5610Article

Pfaffian orientations, 0-1 permanents, and even cycles in directed graphsVAZIRANI, V. V; YANNAKAKIS, M.Discrete applied mathematics. 1989, Vol 25, Num 1-2, pp 179-190, issn 0166-218X, 12 p.Article

Planar graph coloring is not self-reducible, assuming P¬=;NPSAMIR KHULLER; VAZIRANI, V. V.Theoretical computer science. 1991, Vol 88, Num 1, pp 183-189, issn 0304-3975Article

Finding k cuts within twice the optimalHUZUR SARAN; VAZIRANI, V. V.SIAM journal on computing (Print). 1995, Vol 24, Num 1, pp 101-108, issn 0097-5397Article

Improved bounds for the max-flow min-multicut ratio for planar and Kr,r-free graphsTARDOS, E; VAZIRANI, V. V.Information processing letters. 1993, Vol 47, Num 2, pp 77-80, issn 0020-0190Article

Primal-dual RNC approximation algorithms for set cover and covering integer programsRAJAGOPALAN, S; VAZIRANI, V. V.SIAM journal on computing (Print). 1999, Vol 28, Num 2, pp 525-540, issn 0097-5397Article

Efficient sequential and parallel algorithms for maximal bipartite setsPEARSON, D; VAZIRANI, V. V.Journal of algorithms (Print). 1993, Vol 14, Num 2, pp 171-179, issn 0196-6774Article

Approximate max-flow min-(multi)cut theorems and their applicationsNAVEEN GARG; VAZIRANI, V. V; MIHALIS YANNAKAKIS et al.SIAM journal on computing (Print). 1996, Vol 25, Num 2, pp 235-251, issn 0097-5397Article

Maximum matchings in general graphs through randomizationRABIN, M. O; VAZIRANI, V. V.Journal of algorithms (Print). 1989, Vol 10, Num 4, pp 557-567, issn 0196-6774Article

On-line algorithms for weighted bipartite matching and stable marriagesKHULLER, S; MITCHELL, S. G; VAZIRANI, V. V et al.Theoretical computer science. 1994, Vol 127, Num 2, pp 255-267, issn 0304-3975Article

Finding separator cuts in planar graphs within twice the optimalGARG, N; SARAN, H; VAZIRANI, V. V et al.SIAM journal on computing (Print). 2000, Vol 29, Num 1, pp 159-179, issn 0097-5397Article

The two-processor scheduling problem is in random NCVAZIRANI, U. V; VAZIRANI, V. V.SIAM journal on computing (Print). 1989, Vol 18, Num 6, pp 1140-1148, issn 0097-5397Article

Matching is as easy as matrix inversionMULMULEY, K; VAZIRANI, U. V; VAZIRANI, V. V et al.Combinatorica (Print). 1987, Vol 7, Num 1, pp 105-113, issn 0209-9683Article

A natural encoding scheme proved probabilistic polynomial completeVAZIRANI, U. V; VAZIRANI, V. V.Theoretical computer science. 1983, Vol 24, Num 3, pp 291-300, issn 0304-3975Article

The Steiner tree problem and its generalizationsVAZIRANI, V. V.Lecture notes in computer science. 1998, pp 33-38, issn 0302-9743, isbn 3-540-64736-8Conference Paper

Randomized parallel algorithms for matroid union and intersection, with applications to arborescences and edge-disjoint spanning treesNARAYANAN, H; SARAN, H; VAZIRANI, V. V et al.SIAM journal on computing (Print). 1994, Vol 23, Num 2, pp 387-397, issn 0097-5397Article

Processor efficient parallel algorithms for the two disjoint paths problem and for finding a Kuratowski homeomorphKHULLER, S; MITCHELL, S. G; VAZIRANI, V. V et al.SIAM journal on computing (Print). 1992, Vol 21, Num 3, pp 486-506, issn 0097-5397Article

NP is a easy as detecting unique solutionsVALIANT, L. G; VAZIRANI, V. V.Theoretical computer science. 1986, Vol 47, Num 1, pp 85-93, issn 0304-3975Article

An approximation algorithm for the Fault tolerant metric facility location problemJAIN, K; VAZIRANI, V. V.Lecture notes in computer science. 2000, pp 177-183, issn 0302-9743, isbn 3-540-67996-0Conference Paper

Random generation of combinatorial structures from a uniform distributionJERRUM, M. R; VALIANT, L. G; VAZIRANI, V. V et al.Theoretical computer science. 1986, Vol 43, Num 2-3, pp 169-188, issn 0304-3975Article

The art of trellis decoding is computationally hard : for large fieldsJAIN, K; MANDOIU, I; VAZIRANI, V. V et al.IEEE international symposium on information theory. 1998, isbn 0-7803-5000-6, p. 13Conference Paper

Primal-dual approximation algorithms for integral flow and multicut in treesGANG, N; VAZIRANI, V. V; YANNAKAKIS, M et al.Algorithmica. 1997, Vol 18, Num 1, pp 3-20, issn 0178-4617Article

Minimum Multicolored Subgraph Problem in Multiplex PCR Primer Set Selection and Population HaplotypingHAJIAGHAYI, M. T; JAIN, K; LAU, L. C et al.Lecture notes in computer science. 2006, pp 758-766, issn 0302-9743, isbn 3-540-34379-2, 9 p.Conference Paper

  • Page / 1