Daniel Stefankovic

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 Qi Ge

> Home > Persons > Daniel Stefankovic

Publications

2014
[j30]
- view
  authority control:
- export record
  dblp key:
  - journals/rsa/GalanisGSVY14
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/rsa/GalanisGSVY14
Andreas Galanis, Qi Ge, Daniel Stefankovic, Eric Vigoda, Linji Yang:
Improved inapproximability results for counting independent sets in the hard-core model. Random Struct. Algorithms 45(1): 78-110 (2014)
2012
[j28]
- view
  authority control:
- export record
  dblp key:
  - journals/algorithmica/GeS12
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/algorithmica/GeS12
Qi Ge, Daniel Stefankovic:
The Complexity of Counting Eulerian Tours in 4-regular Graphs. Algorithmica 63(3): 588-601 (2012)
[j26]
- view
  authority control:
- export record
  dblp key:
  - journals/cpc/GeS12
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/cpc/GeS12
Qi Ge, Daniel Stefankovic:
A Graph Polynomial for Independent Sets of Bipartite Graphs. Comb. Probab. Comput. 21(5): 695-714 (2012)
2011
[c27]
- view
  authority control:
- export record
  dblp key:
  - conf/approx/GalanisGSVY11
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/conf/approx/GalanisGSVY11
Andreas Galanis, Qi Ge, Daniel Stefankovic, Eric Vigoda, Linji Yang:
Improved Inapproximability Results for Counting Independent Sets in the Hard-Core Model. APPROX-RANDOM 2011: 567-578
[i9]
- view
  - electronic edition @ arxiv.org (open access)
  - references & citations
- export record
  dblp key:
  - journals/corr/abs-1105-5131
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/corr/abs-1105-5131
Andreas Galanis, Qi Ge, Daniel Stefankovic, Eric Vigoda, Linji Yang:
Improved Inapproximability Results for Counting Independent Sets in the Hard-Core Model. CoRR abs/1105.5131 (2011)
2010
[c22]
- view
  - electronic edition via DOI (open access)
  - references & citations
  authority control:
- export record
  dblp key:
  - conf/fsttcs/GeS10
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/conf/fsttcs/GeS10
Qi Ge, Daniel Stefankovic:
A graph polynomial for independent sets of bipartite graphs. FSTTCS 2010: 240-250
[c21]
- view
  authority control:
- export record
  dblp key:
  - conf/latin/GeS10
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/conf/latin/GeS10
Qi Ge, Daniel Stefankovic:
The Complexity of Counting Eulerian Tours in 4-Regular Graphs. LATIN 2010: 638-649
[i5]
- view
  - electronic edition @ arxiv.org (open access)
  - references & citations
- export record
  dblp key:
  - journals/corr/abs-1009-5019
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/corr/abs-1009-5019
Qi Ge, Daniel Stefankovic:
The Complexity of Counting Eulerian Tours in 4-Regular Graphs. CoRR abs/1009.5019 (2010)
2009
[i4]
- view
  - electronic edition @ arxiv.org (open access)
  - references & citations
- export record
  dblp key:
  - journals/corr/abs-0911-4732
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/corr/abs-0911-4732
Qi Ge, Daniel Stefankovic:
A graph polynomial for independent sets of bipartite graphs. CoRR abs/0911.4732 (2009)

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.