共 50 条
- [41] Grid intersection and box intersection graphs on surfaces - Extended abstract GRAPH DRAWING, 1996, 1027 : 365 - 372
- [42] The complexity of approximating the oriented diameter of chordal graphs - (Extended abstract) GRAPH-THEORETIC CONCEPTS IN COMPUTER SCIENCE, 2002, 2573 : 211 - 222
- [43] Finding planar geometric automorphisms in planar graphs (extended abstract) ALGORITHMS AND COMPUTATIONS, 1998, 1533 : 277 - 286
- [44] Compact routing for graphs excluding a fixed minor (Extended abstract) DISTRIBUTED COMPUTING, PROCEEDINGS, 2005, 3724 : 442 - 456
- [45] A Dual-Store Structure for Knowledge Graphs (Extended Abstract) 2022 IEEE 38TH INTERNATIONAL CONFERENCE ON DATA ENGINEERING (ICDE 2022), 2022, : 1523 - 1524
- [46] How to Use Spanning Trees to Navigate in Graphs (Extended Abstract) MATHEMATICAL FOUNDATIONS OF COMPUTER SCIENCE 2009, 2009, 5734 : 282 - 294
- [47] Minus domination in small-degree graphs (extended abstract) GRAPH-THEORETIC CONCEPTS IN COMPUTER SCIENCE, 1998, 1517 : 17 - 25
- [48] The Asymptotic Number of Spanning Trees in Circulant Graphs (Extended Abstract) PROCEEDINGS OF THE NINTH WORKSHOP ON ALGORITHM ENGINEERING AND EXPERIMENTS AND THE FOURTH WORKSHOP ON ANALYTIC ALGORITHMICS AND COMBINATORICS, 2007, : 242 - +
- [49] On representations of some thickness-two graphs - Extended abstract GRAPH DRAWING, 1996, 1027 : 324 - 332
- [50] On dart-free perfectly contractile graphs - Extended abstract LATIN 2000: THEORETICAL INFORMATICS, 2000, 1776 : 135 - 144