THE COMPLEXITY OF THE PARTIAL ORDER DIMENSION PROBLEMYANNAKAKIS M.1982; SIAM J. ALGEBR. DISCRETE METHODS; ISSN 0196-5212; USA; DA. 1982; VOL. 3; NO 3; PP. 351-358; BIBL. 19 REF.Article

A THEORY OF SAFE LOCKING POLICIES IN DATABASE SYSTEMSYANNAKAKIS M.1982; J. ASSOC. COMPUT. MACH.; ISSN 0004-5411; USA; DA. 1982; VOL. 29; NO 3; PP. 718-740; BIBL. 19 REF.Article

EDGE-DELETION PROBLEMSYANNAKAKIS M.1981; SIAM J. COMPUT.; ISSN 0097-5397; USA; DA. 1981; VOL. 10; NO 2; PP. 297-309; BIBL. 16 REF.Article

FREEDOM FROM DEADLOCK OF SAFE LOCKING POLICIESYANNAKAKIS M.1982; SIAM J. COMPUT.; ISSN 0097-5397; USA; DA. 1982; VOL. 11; NO 2; PP. 391-408; BIBL. 17 REF.Article

COMPUTING THE MINIMUM FILL-IN IS NP-COMPLETEYANNAKAKIS M.1981; SIAM J. ALGEBR. DISCRETE METHODS; ISSN 0196-5212; USA; DA. 1981; VOL. 2; NO 1; PP. 77-79; BIBL. 6 REF.Article

WORST-CASE RATIOS FOR PLANAR GRAPHS AND THE METHOD OF INDUCTION ON FACESPAPADIMITRIOU CH; YANNAKAKIS M.1981; ANNUAL SYMPOSIUM ON FOUNDATIONS OF COMPUTER SCIENCE. 22/1981/NASHVILLE TN; USA; NEW YORK: INSTITUTE OF ELECTRICAL & ELECTRONICS ENGINEERS; DA. 1981; PP. 358-363; BIBL. 17 REF.Conference Paper

THE CLIQUE PROBLEM FOR PLANAR GRAPHSPAPADIMITRIOU CH; YANNAKAKIS M.1981; INF. PROCESS. LETT.; ISSN 0020-0190; NLD; DA. 1981; VOL. 13; NO 4-5; PP. 131-133; BIBL. 4 REF.Article

THE COMPLEXITY OF RESTRICTED SPANNING TREE PROBLEMSPAPADIMITRIOU CH; YANNAKAKIS M.1982; J. ASSOC. COMPUT. MACH.; ISSN 0004-5411; USA; DA. 1982; VOL. 29; NO 2; PP. 285-309; BIBL. 18 REF.Article

ALGEBRAIC DEPENDENCIESYANNAKAKIS M; PAPADIMITRIOU CH.1982; J. COMPUT. SYST. SCI.; ISSN 0022-0000; USA; DA. 1982; VOL. 25; NO 1; PP. 2-41; BIBL. 16 REF.Article

ON MINIMAL EULERIAN GRAPHSPAPADIMITRIOU CH; YANNAKAKIS M.1981; INF. PROCESS. LETT.; ISSN 0020-0190; NLD; DA. 1981; VOL. 12; NO 4; PP. 203-205; BIBL. 8 REF.Article

EDGE DOMINATING SETS IN GRAPHSYANNAKAKIS M; GAVRIL F.1980; SIAM J. APPL. MATH.; ISSN 0036-1399; USA; DA. 1980; VOL. 38; NO 3; PP. 364-372; BIBL. 13 REF.Article

On a class of totally unimodular matricesYANNAKAKIS, M.Mathematics of operations research. 1985, Vol 10, Num 2, pp 280-302, issn 0364-765XArticle

INDEPENDENT DATABASE SCHEMASGRAHAM MH; YANNAKAKIS M.1982; SYMPOSIUM ON PRINCIPLES OF DATABASE SYSTEMS/1982-03-29/LOS ANGELES CA; USA; NEW YORK: ASSOCIATION FOR COMPUTING MACHINERY; DA. 1982; PP. 199-204; BIBL. 2 P.Conference Paper

SCHEDULING INTERVAL-ORDERED TASKSPAPADIMITRIOU CH; YANNAKAKIS M.1979; S.I.A.M.J. COMPUTG; USA; DA. 1979; VOL. 8; NO 3; PP. 405-409; BIBL. 10 REF.Article

TOPOLOGICAL CHARACTERIZATION OF FAMILIES OF GRAPHS GENERATED BY CERTAIN TYPES OF GRAPH GRAMMARSYANNAKAKIS M; PAVLIDIS T.1979; INFORM. AND CONTROL; USA; DA. 1979; VOL. 42; NO 1; PP. 72-86; BIBL. 13 REF.Article

LOCKING POLICIES: SAFETY AND FREEDOM FROM DEADLOCKYANNAKAKIS M; PAPADIMITRIOU CH; KUNG HT et al.1979; ANNUAL SYMPOSIUM ON FOUNDATIONS OF COMPUTER SCIENCE. 20/1979/SAN JUAN P.R.; USA; NEW YORK: INSTITUTE OF ELECTRICAL AND ELECTRONICS ENGINEERS; DA. 1979; PP. 286-297; BIBL. 18 REF.Conference Paper

MODELING COMMUNICATIONS PROTOCOLS BY AUTOMATAAHO AV; ULLMAN JD; YANNAKAKIS M et al.1979; ANNUAL SYMPOSIUM ON FOUNDATIONS OF COMPUTER SCIENCE. 20/1979/SAN JUAN P.R.; USA; NEW YORK: INSTITUTE OF ELECTRICAL AND ELECTRONICS ENGINEERS; DA. 1979; PP. 267-273; BIBL. 4 REF.Conference Paper

On the hardness of approximating minimization problemsLUND, C; YANNAKAKIS, M.Journal of the Association for Computing Machinery. 1994, Vol 41, Num 5, pp 960-981, issn 0004-5411Article

Simple local search problems that are hard to solveSCHÄFFER, A. A; YANNAKAKIS, M.SIAM journal on computing (Print). 1991, Vol 20, Num 1, pp 56-87, issn 0097-5397Article

Shortest paths without a mapPAPADIMITRIOU, C. H; YANNAKAKIS, M.Theoretical computer science. 1991, Vol 84, Num 1, pp 127-150, issn 0304-3975, 24 p.Conference Paper

A note on succinct representations of graphsPAPADIMITRIOU, C. H; YANNAKAKIS, M.Information and control. 1986, Vol 71, Num 3, pp 181-185, issn 0019-9958Article

BOUNDS ON THE SIZE AND TRANSMISSION RATE OF COMMUNICATIONS PROTOCOLSAHO AV; WYNER AD; YANNAKAKIS M et al.1982; COMPUT. MATH. WITH APPL.; ISSN 0097-4943; USA; DA. 1982; VOL. 8; NO 3; PP. 205-214; BIBL. 4 REF.Article

Simple linear-time algorithms to test chordality of graphs, test acyclicity of hypergraphs, adn selectively reduce acyclic hypergraphsTARJAN, R. E; YANNAKAKIS, M.SIAM journal on computing (Print). 1984, Vol 13, Num 3, pp 566-579, issn 0097-5397Article

THE COMPLEXITY OF TESTING WHETHER A GRAPHS IS A SUPERCONCENTRATORBLUM M; KARP RM; VORNBERGER O et al.1981; INF. PROCESS. LETT.; ISSN 0020-0190; NLD; DA. 1981; VOL. 13; NO 4-5; PP. 164-167; BIBL. 8 REF.Article

The complexity of probabilistic verificationCOURCOUBETIS, C; YANNAKAKIS, M.Journal of the Association for Computing Machinery. 1995, Vol 42, Num 4, pp 857-907, issn 0004-5411Article