Feodor F. Dragan
Affiliations:- Kent State University, Ohio, USA
According to our database1,
Feodor F. Dragan
authored at least 122 papers
between 1993 and 2024.
Collaborative distances:
Collaborative distances:
Timeline
Legend:
Book In proceedings Article PhD thesis Dataset OtherLinks
Online presence:
-
on cs.kent.edu
On csauthors.net:
Bibliography
2024
Algorithmica, July, 2024
2022
2021
Discret. Comput. Geom., 2021
Fast Deterministic Algorithms for Computing All Eccentricities in (Hyperbolic) Helly Graphs.
Proceedings of the Algorithms and Data Structures - 17th International Symposium, 2021
Proceedings of the Complex Networks & Their Applications X - Volume 1, Proceedings of the Tenth International Conference on Complex Networks and Their Applications COMPLEX NETWORKS 2021, Madrid, Spain, November 30, 2021
2020
An eccentricity 2-approximating spanning tree of a chordal graph is computable in linear time.
Inf. Process. Lett., 2020
Parallelizing pruned landmark labeling: dealing with dependencies in graph algorithms.
Proceedings of the ICS '20: 2020 International Conference on Supercomputing, 2020
2019
Theor. Comput. Sci., 2019
J. Graph Algorithms Appl., 2019
Pruned Landmark Labeling Meets Vertex Centric Computation: A Surprisingly Happy Marriage!
CoRR, 2019
2018
Revisiting Radius, Diameter, and all Eccentricity Computation in Graphs through Certificates.
CoRR, 2018
Proceedings of the Combinatorial Optimization and Applications, 2018
2017
Preface: Special graph classes and algorithms-in honor of Professor Andreas Brandstädt on the occasion of his 65th birthday.
Discret. Appl. Math., 2017
Proceedings of the Twenty-Eighth Annual ACM-SIAM Symposium on Discrete Algorithms, 2017
2016
Networks, 2016
J. Graph Algorithms Appl., 2016
Proceedings of the Graph-Theoretic Concepts in Computer Science, 2016
Proceedings of the Complex Networks VII, 2016
Proceedings of the Combinatorial Optimization and Applications, 2016
2015
Core-Periphery Models for Graphs Based on their δ-Hyperbolicity: An Example Using Biological Networks.
Proceedings of the Complex Networks VI, 2015
2014
Collective additive tree spanners of bounded tree-breadth graphs with generalizations and consequences.
Theor. Comput. Sci., 2014
An Approximation Algorithm for the Tree t-Spanner Problem on Unweighted Graphs via Generalized Chordal Graphs.
Algorithmica, 2014
2013
Proceedings of the Graph-Theoretic Concepts in Computer Science, 2013
2012
Constant Approximation Algorithms for Embedding Graph Metrics into Trees and Outerplanar Graphs.
Discret. Comput. Geom., 2012
Discret. Appl. Math., 2012
Comput. Geom., 2012
Algorithmica, 2012
2011
Theor. Comput. Sci., 2011
SIAM J. Discret. Math., 2011
Data Min. Knowl. Discov., 2011
2010
Proceedings of the Combinatorial Optimization and Applications, 2010
2009
Electron. Notes Discret. Math., 2009
2008
Notes on diameters, centers, and approximating trees of delta-hyperbolic geodesic spaces and graphs.
Electron. Notes Discret. Math., 2008
Proceedings of the Graph-Theoretic Concepts in Computer Science, 2008
Proceedings of the Mathematical Foundations of Computer Science 2008, 2008
Proceedings of the LATIN 2008: Theoretical Informatics, 2008
Succinct summarization of transactional databases: an overlapped hyperrectangle scheme.
Proceedings of the 14th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, 2008
Proceedings of the Algorithms and Computation, 19th International Symposium, 2008
Proceedings of the 8th IEEE International Conference on Data Mining (ICDM 2008), 2008
Diameters, centers, and approximating trees of delta-hyperbolicgeodesic spaces and graphs.
Proceedings of the 24th ACM Symposium on Computational Geometry, 2008
2007
Discret. Appl. Math., 2007
2006
Addressing, distances and routing in triangular systems with applications in cellular networks.
Wirel. Networks, 2006
J. Graph Algorithms Appl., 2006
J. Algorithms, 2006
Proceedings of the Algorithm Theory, 2006
Proceedings of the Algorithms and Complexity, 6th Italian Conference, 2006
2005
Theor. Comput. Sci., 2005
Estimating all pairs shortest paths in restricted graph families: a unified approach.
J. Algorithms, 2005
Proceedings of the Graph-Theoretic Concepts in Computer Science, 2005
Proceedings of the 6th ACIS International Conference on Software Engineering, 2005
Collective Tree Spanners in Graphs with Bounded Genus, Chordality, Tree-Width, or Clique-Width.
Proceedings of the Algorithms and Computation, 16th International Symposium, 2005
2004
Theor. Comput. Sci., 2004
Addressing, Distances and Routing in Triangular Systems with Applications in Cellular and Sensor Networks.
Proceedings of the 18th International Parallel and Distributed Processing Symposium (IPDPS 2004), 2004
Proceedings of the International Conference On Computer Communications and Networks (ICCCN 2004), 2004
2003
Discret. Appl. Math., 2003
Proceedings of the Algorithms and Complexity, 5th Italian Conference, 2003
2002
Provably good global buffering by generalized multiterminalmulticommodity flow approximation.
IEEE Trans. Comput. Aided Des. Integr. Circuits Syst., 2002
Proceedings of the Thirteenth Annual ACM-SIAM Symposium on Discrete Algorithms, 2002
New Routing Schemes for Interval, Circular-Arc, and Permutation Graphs.
Proceedings of the International Conference on Parallel and Distributed Computing Systems, 2002
Proceedings of the LATIN 2002: Theoretical Informatics, 2002
Proceedings of the Algorithms and Computation, 13th International Symposium, 2002
2001
Proceedings of the Algorithms and Data Structures, 7th International Workshop, 2001
Proceedings of ASP-DAC 2001, 2001
2000
SIAM J. Comput., 2000
LexBFS-orderings of Distance-hereditary Graphs with Application to the Diametral Pair Problem.
Discret. Appl. Math., 2000
Strongly Orderable Graphs a Common Generalization of Strongly Chordal and Chordal Bipartite Graphs.
Discret. Appl. Math., 2000
Proceedings of the 2000 IEEE/ACM International Conference on Computer-Aided Design, 2000
1999
J. Algorithms, 1999
Electron. Notes Discret. Math., 1999
Discret. Appl. Math., 1999
1998
A linear-time algorithm for connected r-domination and Steiner tree on distance-hereditary graphs.
Networks, 1998
Discret. Appl. Math., 1998
Proceedings of the Graph-Theoretic Concepts in Computer Science, 1998
1997
Clique <i>r</i>-Domination and Clique <i>r</i>-Packing Problems on Dually Chordal Graphs.
SIAM J. Discret. Math., 1997
Proceedings of the Graph-Theoretic Concepts in Computer Science, 1997
Distance Approximating Trees for Chordal and Dually Chordal Graphs (Extended Abstract).
Proceedings of the Algorithms, 1997
1996
Proceedings of the Graph-Theoretic Concepts in Computer Science, 1996
1995
Proceedings of the Graph-Theoretic Concepts in Computer Science, 1995
Proceedings of the Fundamentals of Computation Theory, 10th International Symposium, 1995
Proceedings of the Fundamentals of Computation Theory, 10th International Symposium, 1995
1994
Proceedings of the Algorithm Theory, 1994
Proceedings of the STACS 94, 1994
Proceedings of the Algorithms, 1994
1993
Comput. Sci. J. Moldova, 1993