Ilya P. Razenshteyn

Name: dblp XML data dump
Creator: Schloss Dagstuhl - Leibniz Center for Informatics
Published: 1993
License: https://creativecommons.org/publicdomain/zero/1.0/
Keywords: dblp, XML, computer science, scholarly publications, metadata

◀ ▶ joint publications with Maxim A. Babenko

> Home > Persons > Ilya P. Razenshteyn

Publications

2010
[j1]
- view
  authority control:
- export record
  dblp key:
  - journals/dmaa/BabenkoGR10
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/dmaa/BabenkoGR10
Maxim A. Babenko, Alexey Gusakov, Ilya P. Razenshteyn:
Triangle-Free 2-Matchings Revisited. Discret. Math. Algorithms Appl. 2(4): 643-654 (2010)
[c2]
- view
  authority control:
- export record
  dblp key:
  - conf/cocoon/BabenkoGR10
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/conf/cocoon/BabenkoGR10
Maxim A. Babenko, Alexey Gusakov, Ilya P. Razenshteyn:
Triangle-Free 2-Matchings Revisited. COCOON 2010: 120-129
[c1]
- view
  authority control:
- export record
  dblp key:
  - conf/sofsem/BabenkoKR10
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/conf/sofsem/BabenkoKR10
Maxim A. Babenko, Ignat I. Kolesnichenko, Ilya P. Razenshteyn:
A Linear Time Algorithm for Finding Three Edge-Disjoint Paths in Eulerian Networks. SOFSEM 2010: 165-175
[i1]
- view
  - electronic edition @ arxiv.org (open access)
  - references & citations
- export record
  dblp key:
  - journals/corr/abs-1003-3085
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/corr/abs-1003-3085
Maxim A. Babenko, Ignat I. Kolesnichenko, Ilya P. Razenshteyn:
A Linear Time Algorithm for Finding Three Edge-Disjoint Paths in Eulerian Networks. CoRR abs/1003.3085 (2010)

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.