| Year |
Citation |
Score |
| 2020 |
Dragan FF, Guarnera HM. Eccentricity function in distance-hereditary graphs Theoretical Computer Science. 833: 26-40. DOI: 10.1016/J.Tcs.2020.05.004 |
0.65 |
|
| 2020 |
Dragan FF, Guarnera HM. Eccentricity terrain of δ-hyperbolic graphs Journal of Computer and System Sciences. 112: 50-65. DOI: 10.1016/J.Jcss.2020.03.004 |
0.538 |
|
| 2020 |
Dragan FF. An eccentricity 2-approximating spanning tree of a chordal graph is computable in linear time Information Processing Letters. 154: 105873. DOI: 10.1016/J.Ipl.2019.105873 |
0.508 |
|
| 2019 |
Chepoi V, Dragan FF, Habib M, Vaxès Y, Alrasheed H. Fast approximation of eccentricities and distances in hyperbolic graphs Journal of Graph Algorithms and Applications. 23: 393-433. DOI: 10.7155/Jgaa.00496 |
0.682 |
|
| 2019 |
Leitert A, Dragan FF. Parameterized approximation algorithms for some location problems in graphs Theoretical Computer Science. 755: 48-64. DOI: 10.1016/J.Tcs.2018.06.049 |
0.654 |
|
| 2019 |
Dragan FF, Guarnera HM. Obstructions to a small hyperbolicity in Helly graphs Discrete Mathematics. 342: 326-338. DOI: 10.1016/J.Disc.2018.10.017 |
0.678 |
|
| 2019 |
Chalopin J, Chepoi V, Dragan FF, Ducoffe G, Mohammed A, Vaxès Y. Fast Approximation and Exact Computation of Negative Curvature Parameters of Graphs Discrete and Computational Geometry. 1-37. DOI: 10.1007/S00454-019-00107-9 |
0.668 |
|
| 2017 |
Dragan FF, Khler E, Alrasheed H. Eccentricity approximating trees Discrete Applied Mathematics. 232: 142-156. DOI: 10.1016/J.Dam.2017.07.017 |
0.736 |
|
| 2017 |
Dragan FF, Kratsch D, Le VB. Preface: Special graph classes and algorithms–in honor of Professor Andreas Brandstädt on the occasion of his 65th birthday Discrete Applied Mathematics. 216: 1. DOI: 10.1016/J.Dam.2016.08.009 |
0.58 |
|
| 2016 |
Dragan FF, Leitert A. Minimum eccentricity shortest paths in some structured graph classes Lecture Notes in Computer Science (Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). 9224: 189-202. DOI: 10.7155/Jgaa.00394 |
0.676 |
|
| 2016 |
Abu-Ata M, Dragan FF. Metric tree-like structures in real-world networks: An empirical study Networks. 67: 49-68. DOI: 10.1002/Net.21631 |
0.674 |
|
| 2015 |
Alrasheed H, Dragan FF. Core-periphery models for graphs based on their δ-hyperbolicity: An example using biological networks Studies in Computational Intelligence. 597: 65-77. DOI: 10.1177/1748301816665519 |
0.674 |
|
| 2015 |
Dragan FF, Leitert A. On the minimum eccentricity shortest path problem Lecture Notes in Computer Science (Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). 9214: 276-288. DOI: 10.1016/J.Tcs.2017.07.004 |
0.583 |
|
| 2014 |
Dragan FF, Abu-Ata M. Collective additive tree spanners of bounded tree-breadth graphs with generalizations and consequences Theoretical Computer Science. 547: 1-17. DOI: 10.1016/J.Tcs.2014.06.007 |
0.683 |
|
| 2014 |
Dragan FF, Köhler E, Leitert A. Line-distortion, bandwidth and path-length of a graph Lecture Notes in Computer Science (Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). 8503: 158-169. DOI: 10.1007/S00453-015-0094-7 |
0.654 |
|
| 2014 |
Dragan FF, Köhler E. An approximation algorithm for the tree t-spanner problem on unweighted graphs via generalized chordal graphs Algorithmica. 69: 884-905. DOI: 10.1007/S00453-013-9765-4 |
0.712 |
|
| 2013 |
Dragan FF, Xiang Y. How to Use Spanning Trees to Navigate in Graphs Algorithmica. 66: 479-511. DOI: 10.1007/S00453-012-9647-1 |
0.719 |
|
| 2013 |
Dragan FF. Tree-like structures in graphs: A metric point of view Lecture Notes in Computer Science (Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). 8165: 1-4. DOI: 10.1007/978-3-642-45043-3_1 |
0.645 |
|
| 2012 |
Dragan FF, Corneil DG, Köhler E, Xiang Y. Collective additive tree spanners for circle graphs and polygonal graphs Discrete Applied Mathematics. 160: 1717-1729. DOI: 10.1016/J.Dam.2012.03.036 |
0.736 |
|
| 2012 |
Chepoi V, Dragan FF, Newman I, Rabinovich Y, Vaxès Y. Constant Approximation Algorithms for Embedding Graph Metrics into Trees and Outerplanar Graphs Discrete and Computational Geometry. 47: 187-214. DOI: 10.1007/S00454-011-9386-0 |
0.555 |
|
| 2011 |
Dragan FF, Fomin FV, Golovach PA. Approximation of minimum weight spanners for sparse graphs Theoretical Computer Science. 412: 846-852. DOI: 10.1016/J.Tcs.2010.11.034 |
0.675 |
|
| 2011 |
Xiang Y, Jin R, Fuhry D, Dragan FF. Summarizing transactional databases with overlapped hyperrectangles Data Mining and Knowledge Discovery. 23: 215-251. DOI: 10.1007/S10618-010-0203-9 |
0.419 |
|
| 2011 |
Dragan FF, Matamala M. Navigating in a graph by aid of its spanning tree metric* Siam Journal On Discrete Mathematics. 25: 306-332. |
0.658 |
|
| 2010 |
Chepoi V, Dragan FF, Estellon B, Habib M, Vaxès Y, Xiang Y. Additive Spanners and Distance and Routing Labeling Schemes for Hyperbolic Graphs Algorithmica (New York). 1-20. DOI: 10.1007/S00453-010-9478-X |
0.558 |
|
| 2010 |
Dragan FF, Yan C. Collective tree spanners in graphs with bounded parameters Algorithmica (New York). 57: 22-43. DOI: 10.1007/S00453-008-9194-Y |
0.749 |
|
| 2010 |
Busch AH, Dragan FF, Sritharan R. New min-max theorems for weakly chordal and dually chordal graphs Lecture Notes in Computer Science (Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). 6509: 207-218. DOI: 10.1007/978-3-642-17461-2_17 |
0.501 |
|
| 2010 |
Dragan FF, Yan C. Network flow spanners Networks. 56: 159-168. DOI: 10.1002/Net.V56:3 |
0.465 |
|
| 2009 |
Breitbart Y, Dragan FF, Gobjuka H. Effective monitor placement in internet networks Journal of Networks. 4: 657-666. DOI: 10.4304/Jnw.4.7.657-666 |
0.38 |
|
| 2009 |
Dragan FF, Xiang Y, Yan C. Collective Tree Spanners for Unit Disk Graphs with Applications Electronic Notes in Discrete Mathematics. 32: 117-124. DOI: 10.1016/J.Endm.2009.02.016 |
0.597 |
|
| 2009 |
Yan C, Xiang Y, Dragan FF. Compact and low delay routing labeling scheme for unit disk graphs Lecture Notes in Computer Science (Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). 5664: 566-577. DOI: 10.1016/J.Comgeo.2012.01.015 |
0.524 |
|
| 2009 |
Dragan FF, Xiang Y. How to use spanning trees to navigate in graphs (Extended abstract) Lecture Notes in Computer Science (Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). 5734: 282-294. DOI: 10.1007/978-3-642-03816-7_25 |
0.672 |
|
| 2008 |
Chepoi V, Dragan FF, Estellon B, Habib M, Vaxès Y. Diameters, centers, and approximating trees of δ-Hyperbolic geodesic spaces and graphs Proceedings of the Annual Symposium On Computational Geometry. 59-68. DOI: 10.1145/1377676.1377687 |
0.489 |
|
| 2008 |
Jin R, Xiang Y, Fuhry D, Dragan FF. Overlapping matrix pattern visualization: A hypergraph approach Proceedings - Ieee International Conference On Data Mining, Icdm. 313-322. DOI: 10.1109/ICDM.2008.102 |
0.321 |
|
| 2008 |
Dragan FF, Fomin FV, Golovach PA. Spanners in sparse graphs Lecture Notes in Computer Science (Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). 5125: 597-608. DOI: 10.1016/J.Jcss.2010.10.002 |
0.688 |
|
| 2008 |
Chepoi V, Dragan FF, Estellon B, Habib M, Vaxès Y. Notes on diameters, centers, and approximating trees of δ-hyperbolic geodesic spaces and graphs Electronic Notes in Discrete Mathematics. 31: 231-234. DOI: 10.1016/J.Endm.2008.06.046 |
0.641 |
|
| 2008 |
Dragan FF, Corneil DG, Köhler E, Xiang Y. Additive spanners for circle graphs and polygonal graphs Lecture Notes in Computer Science (Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). 5344: 110-121. DOI: 10.1007/978-3-540-92248-3_11 |
0.625 |
|
| 2008 |
Dragan FF, Matamala M. Navigating in a graph by aid of its spanning tree Lecture Notes in Computer Science (Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). 5369: 788-799. DOI: 10.1007/978-3-540-92182-0_69 |
0.657 |
|
| 2008 |
Dragan FF, Fomin FV, Golovach PA. A PTAS for the sparsest spanners problem on apex-minor-free graphs Lecture Notes in Computer Science (Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). 5162: 290-298. DOI: 10.1007/978-3-540-85238-4_23 |
0.601 |
|
| 2008 |
Dragan FF, Yan C, Xiang Y. Collective additive tree spanners of homogeneously orderable graphs Lecture Notes in Computer Science (Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). 4957: 555-567. DOI: 10.1007/978-3-540-78773-0_48 |
0.689 |
|
| 2007 |
Dourisboure Y, Dragan FF, Gavoille C, Yan C. Spanners for bounded tree-length graphs Theoretical Computer Science. 383: 34-44. DOI: 10.1016/J.Tcs.2007.03.058 |
0.661 |
|
| 2007 |
Dragan FF, Lomonosov I. On compact and efficient routing in certain graph classes Discrete Applied Mathematics. 155: 1458-1470. DOI: 10.1016/J.Dam.2007.03.011 |
0.768 |
|
| 2007 |
Brandstädt A, Dragan FF, Le HO, Le VB, Uehara R. Tree spanners for bipartite graphs and probe interval graphs Algorithmica (New York). 47: 27-51. DOI: 10.1007/S00453-006-1209-Y |
0.72 |
|
| 2006 |
Dragan FF, Yan C, Corneil DG. Collective tree spanners and routing in AT-free related graphs Journal of Graph Algorithms and Applications. 10: 97-122. DOI: 10.7155/Jgaa.00120 |
0.742 |
|
| 2006 |
Chepoi V, Dragan FF, Vaxès Y. Distance and routing labeling schemes for non-positively curved plane graphs Journal of Algorithms. 61: 60-88. DOI: 10.1016/J.Jalgor.2004.07.011 |
0.586 |
|
| 2006 |
Chepoi V, Dragan FF, Vaxès Y. Addressing, distances and routing in triangular systems with applications in cellular networks Wireless Networks. 12: 671-679. DOI: 10.1007/S11276-006-6527-0 |
0.476 |
|
| 2006 |
Dragan FF, Yan C. Distance approximating trees: Complexity and algorithms Lecture Notes in Computer Science (Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). 3998: 260-271. DOI: 10.1007/11758471_26 |
0.561 |
|
| 2006 |
Brandstädt A, Dragan FF, Xiang Y, Yan C. Generalized powers of graphs and their algorithmic use Lecture Notes in Computer Science (Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). 4059: 423-434. |
0.463 |
|
| 2005 |
Chepoi V, Dragan FF, Vaxès Y. Distance-based location update and routing in irregular cellular networks Proceedings - Sixth Int. Conf. On Softw. Eng., Artificial Intelligence, Netw. and Parallel/Distributed Computing and First Acis Int. Workshop On Self-Assembling Wireless Netw., Snpd/Sawn 2005. 2005: 380-387. DOI: 10.1109/SNPD-SAWN.2005.32 |
0.459 |
|
| 2005 |
Chepoi VD, Dragan FF, Yan C. Additive sparse spanners for graphs with bounded length of largest induced cycle Theoretical Computer Science. 347: 54-75. DOI: 10.1016/J.Tcs.2005.05.017 |
0.644 |
|
| 2005 |
Brandstädt A, Dragan FF, Le HO, Mosca R. New graph classes of bounded clique-width Theory of Computing Systems. 38: 623-645. DOI: 10.1007/S00224-004-1154-6 |
0.636 |
|
| 2005 |
Corneil DG, Dragan FF, Köhler E, Yan C. Collective tree 1-spanners for interval graphs Lecture Notes in Computer Science (Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). 3787: 151-162. DOI: 10.1007/11604686_14 |
0.648 |
|
| 2005 |
Dragan FF, Yan C. Collective tree spanners in graphs with bounded genus, chordality, tree-width, or clique-width Lecture Notes in Computer Science (Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). 3827: 583-592. DOI: 10.1007/11602613_59 |
0.632 |
|
| 2004 |
Dragan FF, Yan C, Lomonosov I. Collective tree spanners of graphs Lecture Notes in Computer Science (Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). 3111: 64-76. DOI: 10.1137/S089548010444167X |
0.806 |
|
| 2004 |
Dragan FF, Yan C, Lomonosov I. Collective tree spanners of graphs Lecture Notes in Computer Science (Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). 3111: 64-76. DOI: 10.1137/S089548010444167X |
0.816 |
|
| 2004 |
Brandstädt A, Dragan FF, Le HO, Le VB. Tree spanners on chordal graphs: Complexity and algorithms Theoretical Computer Science. 310: 329-354. DOI: 10.1016/S0304-3975(03)00424-9 |
0.662 |
|
| 2004 |
Dragan FF, Lomonosov I. On compact and efficient routing in certain graph classes (extended abstract) Lecture Notes in Computer Science (Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). 3341: 402-414. |
0.753 |
|
| 2003 |
Brandstädt A, Dragan FF. On linear and circular structure of (claw, net)-free graphs Discrete Applied Mathematics. 129: 285-303. DOI: 10.1016/S0166-218X(02)00571-1 |
0.666 |
|
| 2003 |
Chepoi V, Dragan F. Finding a central vertex in an HHD-free graph Discrete Applied Mathematics. 131: 93-111. DOI: 10.1016/S0166-218X(02)00419-5 |
0.704 |
|
| 2003 |
Corneil DG, Dragan FF, Köhler E. On the Power of BFS to Determine a Graph's Diameter Networks. 42: 209-222. DOI: 10.1002/Net.10098 |
0.638 |
|
| 2003 |
Chepoi VD, Dragan FF, Yan C. Additive spanners for k-chordal graphs Lecture Notes in Computer Science (Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). 2653: 96-107. |
0.53 |
|
| 2002 |
Dragan FF, Kahng AB, Mǎndoiu II, Muddu S, Zelikovsky A. Provably good global buffering by generalized multiterminal multicommodity flow approximation Ieee Transactions On Computer-Aided Design of Integrated Circuits and Systems. 21: 263-274. DOI: 10.1109/43.986421 |
0.316 |
|
| 2002 |
Brandstadt A, Dragan FF, Le HO, Le VB. Tree spanners on chordal graphs: Complexity, algorithms, open problems Lecture Notes in Computer Science (Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). 2518: 163-174. DOI: 10.1007/3-540-36136-7_15 |
0.603 |
|
| 2002 |
Corneil DG, Dragan FF, Köhler E. On the power of BFS to determine a graphs diameter Lecture Notes in Computer Science (Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). 2286: 209-223. |
0.547 |
|
| 2001 |
Corneil DG, Dragan FF, Habib M, Paul C. Diameter determination on restricted graph families Discrete Applied Mathematics. 113: 143-166. DOI: 10.1016/S0166-218X(00)00281-X |
0.613 |
|
| 2001 |
Dragan FF. Estimating all pairs shortest paths in restricted graph families: A unified approach Lecture Notes in Computer Science (Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). 2204: 103-116. DOI: 10.1016/J.Jalgor.2004.09.002 |
0.638 |
|
| 2001 |
Dragan FF, Kahng AB, M Ã Ndoiu II, Muddu S, Zelikovsky A. Practical approximation algorithms for separable packing linear programs Lecture Notes in Computer Science (Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). 2125: 325-337. DOI: 10.1007/3-540-44634-6_30 |
0.326 |
|
| 2000 |
Brandstädt A, Dragan FF, Köhler E. Linear time algorithms for Hamiltonian problems on (claw,net)-free graphs Siam Journal On Computing. 30: 1662-1677. DOI: 10.1137/S0097539799357775 |
0.657 |
|
| 2000 |
Dragan FF, Nicolai F. LexBFS-orderings of distance-hereditary graphs with application to the diametral pair problem Discrete Applied Mathematics. 98: 191-207. DOI: 10.1016/S0166-218X(99)00157-2 |
0.688 |
|
| 2000 |
Dragan FF. Strongly orderable graphs a common generalization of strongly chordal and chordal bipartite graphs Discrete Applied Mathematics. 99: 427-442. DOI: 10.1016/S0166-218X(99)00149-3 |
0.671 |
|
| 2000 |
Brandstädt A, Dragan FF, Le VB, Szymczak T. On stable cutsets in graphs Discrete Applied Mathematics. 105: 39-50. DOI: 10.1016/S0166-218X(00)00197-9 |
0.62 |
|
| 2000 |
Chepoi V, Dragan F. A Note on Distance Approximating Trees in Graphs The Journal of Combinatorics. 21: 761-766. DOI: 10.1006/Eujc.1999.0381 |
0.657 |
|
| 1999 |
Dragan FF, Nicolai F, Brandstädt A. Convexity and HHD-free graphs Siam Journal On Discrete Mathematics. 12: 119-135. DOI: 10.1137/S0895480195321718 |
0.632 |
|
| 1999 |
Dragan FF, Nicolai F. LexBFS-orderings and powers of HHD-free graphs International Journal of Computer Mathematics. 71: 35-56. DOI: 10.1080/00207169908804791 |
0.653 |
|
| 1999 |
Chepoi V, Dragan FF. A note on distance approximating trees in graphs Electronic Notes in Discrete Mathematics. 3: 39. DOI: 10.1016/S1571-0653(05)80019-8 |
0.707 |
|
| 1999 |
Dragan FF. Almost diameter of a house-hole-free graph in linear time via LexBFS Discrete Applied Mathematics. 95: 223-239. DOI: 10.1016/S0166-218X(99)00077-3 |
0.656 |
|
| 1999 |
Brandstädt A, Chepoi V, Dragan F. Distance Approximating Trees for Chordal and Dually Chordal Graphs Journal of Algorithms. 30: 166-184. DOI: 10.1006/Jagm.1998.0962 |
0.705 |
|
| 1998 |
Brandstädt A, Dragan F, Chepoi V, Voloshin V. Dually Chordal Graphs Siam Journal On Discrete Mathematics. 11: 437-455. DOI: 10.1137/S0895480193253415 |
0.677 |
|
| 1998 |
Dragan FF, Nicolai F, Brandstädt A. Powers of HHD-free graphs International Journal of Computer Mathematics. 69: 217-242. DOI: 10.1080/00207169808804720 |
0.65 |
|
| 1998 |
Chepoi V, Dragan FF. Condorcet and median points of simple rectilinear polygons Recherche - Transports - Securite. 61: 21-35. DOI: 10.1016/S0966-8349(96)00005-8 |
0.307 |
|
| 1998 |
Brandstädt A, Chepoi VD, Dragan FF. The algorithmic use of hypertree structure and maximum neighbourhood orderings Discrete Applied Mathematics. 82: 43-77. DOI: 10.1016/S0166-218X(97)00125-X |
0.699 |
|
| 1998 |
Brandstädt A, Dragan FF. A Linear-Time Algorithm for Connected r-Domination and Steiner Tree on Distance-Hereditary Graphs Networks. 31: 177-182. DOI: 10.1002/(Sici)1097-0037(199805)31:3<177::Aid-Net4>3.0.Co;2-C |
0.698 |
|
| 1997 |
Brandstädt A, Chepoi VD, Dragan FF. Clique r-domination and clique r-packing problems on dually chordal graphs Siam Journal On Discrete Mathematics. 10: 109-127. DOI: 10.1137/S0895480194267853 |
0.552 |
|
| 1997 |
Brandstädt A, Dragan FF, Nicolai F. Homogeneously orderable graphs Theoretical Computer Science. 172: 209-232. DOI: 10.1016/S0304-3975(96)00091-6 |
0.695 |
|
| 1997 |
Brandstädt A, Dragan FF, Nicolai F. LexBFS-orderings and powers of chordal graphs Discrete Mathematics. 171: 27-42. DOI: 10.1016/S0012-365X(96)00070-2 |
0.663 |
|
| 1997 |
Dragan FF, Nicolai F, Brandstädt A. LexBFS-orderings and powers of graphs Lecture Notes in Computer Science (Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). 1197: 166-180. DOI: 10.1007/3-540-62559-3_15 |
0.619 |
|
| 1997 |
Dragan FF, Nicolai F. r-domination problems on homogeneously orderable graphs Networks. 30: 121-131. DOI: 10.1002/(Sici)1097-0037(199709)30:2<121::Aid-Net6>3.0.Co;2-E |
0.565 |
|
| 1997 |
Dragan FF. On greedy matching ordering and greedy matchable graphs Lecture Notes in Computer Science (Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). 1335: 184-198. |
0.618 |
|
| 1996 |
Dragan FF, Voloshin VI. Incidence graphs of biacyclic hypergraphs Discrete Applied Mathematics. 68: 259-266. DOI: 10.1016/0166-218X(95)00070-8 |
0.67 |
|
| 1996 |
Dragan FF, Brandstädt A. r-Dominating cliques in graphs with hypertree structure Discrete Mathematics. 162: 93-108. DOI: 10.1016/0012-365X(95)00277-4 |
0.615 |
|
| 1996 |
Brandstädt A, Chepoi VD, Dragan FF. Perfect elimination orderings of chordal powers of graphs Discrete Mathematics. 158: 273-278. DOI: 10.1016/0012-365X(95)00081-7 |
0.64 |
|
| 1995 |
Brandstädt A, Dragan FF, Nicolai F. Homogeneously orderable graphs and the steiner tree problem Lecture Notes in Computer Science (Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). 1017: 381-395. |
0.642 |
|
| 1995 |
Dragan FF, Nicolai F. r-domination problems on homogeneously orderable graphs: (Extended abstract) Lecture Notes in Computer Science (Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). 965: 201-210. |
0.462 |
|
| 1994 |
Chepoi V, Dragan F. Computing a median point of a simple rectilinear polygon Information Processing Letters. 49: 281-285. DOI: 10.1016/0020-0190(94)90100-7 |
0.352 |
|
| 1993 |
Dragan FF. Domination in quadrangle-free helly graphs Cybernetics and Systems Analysis. 29: 822-829. DOI: 10.1007/Bf01122734 |
0.664 |
|
| Show low-probability matches. |