45,073 Works

Urbanization and Urban Public Policy in Baku

Turkhan Sadigov, Fuad Jafarli, Farid Guliyev, Nazaket Azimli & Anar Valiyev
Caucasus Analytical Digest (CAD), 101

Nr.99: Georgia's relations with the EU

Shu Uchida, Shota Kakabadze & Tinatin Zurabishvili
Caucasus Analytical Digest (CAD), 99

Parlamentary Elections in Georgia

Tamar Iakobidze, Tornike Zurabashvili & Teona Turashvili
Caucasus Analytical Digest (CAD), 89

Human Capital Development in Azerbaijan

Lucy Wallwork, Farid Guliyev, Nazaket Azimli & Surayya Mammadova
ISSN:1867-9323

Presidential Elections in Georgia

Tornike Sharashenidze & Martha Beard
Caucasus Analytical Digest (CAD), 56

Political Country Rankings

Heiko Pleines & Anar Mammadli
Caucasus Analytical Digest (CAD), 63

Planar 3-SAT with a clause/variable cycle

Alexander Pilz
16th Scandinavian Symposium and Workshops on Algorithm Theory (SWAT 2018)

Measurement and laser control of attosecond charge migration in ionized iodoacetylene

Oleg I. Tolstikhin, Alisa Rupenyan, Lars B. Madsen, Peter M. Kraus, André D. Bandrauk, Denitsa Baykusheva, Lubos Horný, Emmanuel F. Penka, Frank Jensen, Françoise Remacle, Guido Grassi, Johannes Schneider, Hans Jakob Wörner & Benoît Mignolet
ISSN:1095-9203

Effcient oracles and routing schemes for replacement paths

Davide Bilò, Stefano Leucci, Guido Proietti, Luciano Gualà, Merav Parter & Keerti Choudhary
Real life graphs and networks are prone to failure of nodes (vertices) and links (edges). In particular, for a pair of nodes s and t and a failing edge e in an n-vertex unweighted graph G=(V(G),E(G)), the replacement path pi_{G-e}(s,t) is a shortest s-t path that avoids e. In this paper we present several efficient constructions that, for every (s,t) \in S x T, where S, T \subseteq V(G), and every e \in E(G), maintain...

Cities in the South Caucasus

Joseph Salukvadze, Anar Valiyev & Sarhat Petrosyan
ISSN:1867-9323

Evaluation of digital soil mapping approaches with large sets of environmental covariates

Madlene Nussbaum, Kay Spiess, Urs Grob, Andreas Jürg Papritz, Andri Baltensweiler, Michael E. Schaepman, Lucie Greiner & Armin Keller
SOIL, 4 (1)

Armenian Protests and Politics

Karena Avedissian, Arpy Manusyan, Sona Manusyan, Armen Ghazaryan & Armine Ishkanian
Caucasus Analytical Digest (CAD), 91

Karabakh Conflict

Sergey Rumyansev, Shalala Mammadova, Arsène Saparov & Vicken Cheterian
ISSN:1867-9323

Solving and sampling with many solutions: Satisfiability and other hard problems

Emo Welzl, Jean Cardinal & Jerri Nummenpalo
We investigate parameterizing hard combinatorial problems by the size of the solution set compared to all solution candidates. Our main result is a uniform sampling algorithm for satisfying assignments of 2-CNF formulas that runs in expected time O∗(ϵ-0.617) where ϵ is the fraction of assignments that are satisfying. This improves significantly over the trivial sampling bound of expected Θ∗(ϵ-1), and on all previous algorithms whenever ϵ = Ω(0.708n). We also consider algorithms for 3-SAT with...

Registration Year

  • 2009
    22,228
  • 2010
    1,267
  • 2011
    1,512
  • 2012
    1,481
  • 2013
    1,331
  • 2014
    1,505
  • 2015
    1,220
  • 2016
    1,795
  • 2017
    3,194
  • 2018
    8,024
  • 2019
    1,516

Resource Types

  • Text
    44,471
  • Event
    383
  • Collection
    141
  • Model
    15
  • Audiovisual
    14
  • Image
    11
  • Other
    5
  • Sound
    2
  • Software
    1

Data Centers

  • ETH Zürich Research Collection
    45,073