共 50 条
- [1] A POLYNOMIAL ALGORITHM FOR RECOGNIZING CIRCLE GRAPHS [J]. COMPTES RENDUS DE L ACADEMIE DES SCIENCES SERIE I-MATHEMATIQUE, 1985, 300 (16): : 569 - 572
- [2] A POLYNOMIAL-TIME CIRCLE PACKING ALGORITHM [J]. DISCRETE MATHEMATICS, 1993, 117 (1-3) : 257 - 263
- [3] A POLYNOMIAL-TIME ALGORITHM RECOGNIZING LINK TREES [J]. JOURNAL OF GRAPH THEORY, 1995, 19 (03) : 417 - 433
- [4] DYNAMIC-PROGRAMMING ALGORITHMS FOR RECOGNIZING SMALL-BANDWIDTH GRAPHS IN POLYNOMIAL-TIME [J]. SIAM JOURNAL ON ALGEBRAIC AND DISCRETE METHODS, 1980, 1 (04): : 363 - 369
- [5] Recognizing hyperelliptic graphs in polynomial time [J]. THEORETICAL COMPUTER SCIENCE, 2020, 815 : 121 - 146
- [6] Polynomial-Time Algorithm for the Leafage of Chordal Graphs [J]. ALGORITHMS - ESA 2009, PROCEEDINGS, 2009, 5757 : 290 - +
- [8] Polynomial-time approximation schemes for geometric graphs [J]. PROCEEDINGS OF THE TWELFTH ANNUAL ACM-SIAM SYMPOSIUM ON DISCRETE ALGORITHMS, 2001, : 671 - 679
- [10] Polynomial-Time Approximation Schemes for Circle Packing Problems [J]. ALGORITHMS - ESA 2014, 2014, 8737 : 713 - 724