Russell Martin

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 Prasad Chebolu

> Home > Persons > Russell Martin

Publications

2013
[i7]
- view
  - electronic edition @ arxiv.org (open access)
  - references & citations
- export record
  dblp key:
  - journals/corr/CheboluCM13
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/corr/CheboluCM13
Prasad Chebolu, Mary Cryan, Russell Martin:
Exact counting of Euler Tours for Graphs of Bounded Treewidth. CoRR abs/1310.0185 (2013)
2012
[j15]
- view
  - electronic edition via DOI (open access)
  - references & citations
  authority control:
- export record
  dblp key:
  - journals/jcss/CheboluGM12
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/jcss/CheboluGM12
Prasad Chebolu, Leslie Ann Goldberg, Russell Martin:
The complexity of approximately counting stable roommate assignments. J. Comput. Syst. Sci. 78(5): 1579-1605 (2012)
[j14]
- view
  - electronic edition via DOI (open access)
  - references & citations
  authority control:
- export record
  dblp key:
  - journals/jda/CheboluCM12
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/jda/CheboluCM12
Prasad Chebolu, Mary Cryan, Russell Martin:
Exact counting of Euler tours for generalized series-parallel graphs. J. Discrete Algorithms 10: 110-122 (2012)
[j12]
- view
  - electronic edition via DOI (open access)
  - references & citations
  authority control:
- export record
  dblp key:
  - journals/tcs/CheboluGM12
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/tcs/CheboluGM12
Prasad Chebolu, Leslie Ann Goldberg, Russell Martin:
The complexity of approximately counting stable matchings. Theor. Comput. Sci. 437: 35-68 (2012)
2010
[c10]
- view
  authority control:
- export record
  dblp key:
  - conf/approx/CheboluGM10
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/conf/approx/CheboluGM10
Prasad Chebolu, Leslie Ann Goldberg, Russell A. Martin:
The Complexity of Approximately Counting Stable Matchings. APPROX-RANDOM 2010: 81-94
[i6]
- view
  - electronic edition @ arxiv.org (open access)
  - references & citations
- export record
  dblp key:
  - journals/corr/abs-1004-1836
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/corr/abs-1004-1836
Prasad Chebolu, Leslie Ann Goldberg, Russell A. Martin:
The Complexity of Approximately Counting Stable Matchings. CoRR abs/1004.1836 (2010)
[i5]
- view
  - electronic edition @ arxiv.org (open access)
  - references & citations
- export record
  dblp key:
  - journals/corr/abs-1005-3477
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/corr/abs-1005-3477
Prasad Chebolu, Mary Cryan, Russell A. Martin:
Exact counting of Euler Tours for generalized series-parallel graphs. CoRR abs/1005.3477 (2010)
[i4]
- view
  - electronic edition @ arxiv.org (open access)
  - references & citations
- export record
  dblp key:
  - journals/corr/abs-1012-1237
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/corr/abs-1012-1237
Prasad Chebolu, Leslie Ann Goldberg, Russell A. Martin:
The Complexity of Approximately Counting Stable Roommate Assignments. CoRR abs/1012.1237 (2010)

a service of

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.