Остановите войну!
for scientists:
default search action
Feodor F. Dragan
- > Home > Persons > Feodor F. Dragan
Publications
- 2007
- [j40]Andreas Brandstädt, Feodor F. Dragan, Hoàng-Oanh Le, Van Bang Le, Ryuhei Uehara:
Tree Spanners for Bipartite Graphs and Probe Interval Graphs. Algorithmica 47(1): 27-51 (2007) - 2006
- [c33]Andreas Brandstädt, Feodor F. Dragan, Yang Xiang, Chenyu Yan:
Generalized Powers of Graphs and Their Algorithmic Use. SWAT 2006: 423-434 - 2005
- [j32]Andreas Brandstädt, Feodor F. Dragan, Hoàng-Oanh Le, Raffaele Mosca:
New Graph Classes of Bounded Clique-Width. Theory Comput. Syst. 38(5): 623-645 (2005) - 2004
- [j30]Andreas Brandstädt, Feodor F. Dragan, Hoàng-Oanh Le, Van Bang Le:
Tree spanners on chordal graphs: complexity and algorithms. Theor. Comput. Sci. 310(1-3): 329-354 (2004) - 2003
- [j29]Andreas Brandstädt, Feodor F. Dragan:
On linear and circular structure of (claw, net)-free graphs. Discret. Appl. Math. 129(2-3): 285-303 (2003) - [c23]Andreas Brandstädt, Feodor F. Dragan, Hoàng-Oanh Le, Van Bang Le, Ryuhei Uehara:
Tree Spanners for Bipartite Graphs and Probe Interval Graphs. WG 2003: 106-118 - 2002
- [c22]Andreas Brandstädt, Feodor F. Dragan, Hoàng-Oanh Le, Van Bang Le:
Tree Spanners on Chordal Graphs: Complexity, Algorithms, Open Problems. ISAAC 2002: 163-174 - [c18]Andreas Brandstädt, Feodor F. Dragan, Hoàng-Oanh Le, Raffaele Mosca:
New Graph Classes of Bounded Clique-Width. WG 2002: 57-67 - 2000
- [j22]Andreas Brandstädt, Feodor F. Dragan, Van Bang Le, Thomas Szymczak:
On stable cutsets in graphs. Discret. Appl. Math. 105(1-3): 39-50 (2000) - [j20]Andreas Brandstädt, Feodor F. Dragan, Ekkehard Köhler:
Linear Time Algorithms for Hamiltonian Problems on (Claw, Net)-Free Graphs. SIAM J. Comput. 30(5): 1662-1677 (2000) - 1999
- [j16]Andreas Brandstädt, Victor Chepoi, Feodor F. Dragan:
Distance Approximating Trees for Chordal and Dually Chordal Graphs. J. Algorithms 30(1): 166-184 (1999) - [j15]Feodor F. Dragan, Falk Nicolai, Andreas Brandstädt:
Convexity and HHD-Free Graphs. SIAM J. Discret. Math. 12(1): 119-135 (1999) - [c13]Andreas Brandstädt, Feodor F. Dragan, Ekkehard Köhler:
Linear Time Algorithms for Hamiltonian Problems on (Claw, Net)-Free Graphs. WG 1999: 364-376 - 1998
- [j14]Andreas Brandstädt, Victor Chepoi, Feodor F. Dragan:
The Algorithmic Use of Hypertree Structure and Maximum Neighbourhood Orderings. Discret. Appl. Math. 82(1-3): 43-77 (1998) - [j13]Feodor F. Dragan, Falk Nicolai, Andreas Brandstädt:
Powers of hhd-free graphs. Int. J. Comput. Math. 69(3-4): 217-242 (1998) - [j12]Andreas Brandstädt, Feodor F. Dragan:
A linear-time algorithm for connected r-domination and Steiner tree on distance-hereditary graphs. Networks 31(3): 177-182 (1998) - [j11]Andreas Brandstädt, Feodor F. Dragan, Victor Chepoi, Vitaly I. Voloshin:
Dually Chordal Graphs. SIAM J. Discret. Math. 11(3): 437-455 (1998) - 1997
- [j10]Andreas Brandstädt, Feodor F. Dragan, Falk Nicolai:
LexBFS-orderings and powers of chordal graphs. Discret. Math. 171(1-3): 27-42 (1997) - [j8]Andreas Brandstädt, Victor Chepoi, Feodor F. Dragan:
Clique r-Domination and Clique r-Packing Problems on Dually Chordal Graphs. SIAM J. Discret. Math. 10(1): 109-127 (1997) - [j7]Andreas Brandstädt, Feodor F. Dragan, Falk Nicolai:
Homogeneously Orderable Graphs. Theor. Comput. Sci. 172(1-2): 209-232 (1997) - [c11]Andreas Brandstädt, Victor Chepoi, Feodor F. Dragan:
Distance Approximating Trees for Chordal and Dually Chordal Graphs (Extended Abstract). ESA 1997: 78-91 - 1996
- [j5]Andreas Brandstädt, Victor Chepoi, Feodor F. Dragan:
Perfect elimination orderings of chordal powers of graphs. Discret. Math. 158(1-3): 273-278 (1996) - [j4]Feodor F. Dragan, Andreas Brandstädt:
r-Dominating cliques in graphs with hypertree structure. Discret. Math. 162(1-3): 93-108 (1996) - [c9]Feodor F. Dragan, Falk Nicolai, Andreas Brandstädt:
LexBFS-Orderings and Power of Graphs. WG 1996: 166-180 - 1995
- [c6]Andreas Brandstädt, Feodor F. Dragan, Falk Nicolai:
Homogeneously Orderable Graphs and the Steiner Tree Problem. WG 1995: 381-395 - 1994
- [c4]Feodor F. Dragan, Andreas Brandstädt:
Dominating Cliques in Graphs with Hypertree Structures. STACS 1994: 735-746 - [c2]Andreas Brandstädt, Victor Chepoi, Feodor F. Dragan:
The Algorithmic Use of Hypertree Structure and Maximum Neighbourhood Orderings. WG 1994: 65-80 - 1993
- [c1]Andreas Brandstädt, Feodor F. Dragan, Victor Chepoi, Vitaly I. Voloshin:
Dually Chordal Graphs. WG 1993: 237-251
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from , , and to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from .
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-02-06 23:50 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint