_id,doi,title
11773,10.1007/978-3-662-48995-6_8,Ad exchange: Envy-free auctions with mediators
11774,10.1007/978-3-662-48995-6_17,Combinatorial auctions with conflict-based externalities
11785,10.1007/978-3-662-47672-7_59,Improved algorithms for decremental single-source reachability on directed graphs
11786,10.1007/978-3-662-47672-7_17,Design of dynamic algorithms via primal-dual method
11787,10.1007/978-3-662-47672-7_58,Finding 2-edge and 2-vertex strongly connected components in quadratic time
11788,10.1007/978-3-319-18263-6_14,Online ad assignment with an ad exchange
10793,10.1007/978-3-662-45803-7_36,Clustered planarity testing revisited
10884,10.1007/978-3-642-54013-4_15,Parameterized model checking of token-passing systems
10885,10.1007/978-3-642-54013-4_5,Doomsday equilibria for omega-regular games
10892,10.1007/978-3-319-13075-0_10,Planar matchings for weighted straight skeletons
10894,10.1007/978-3-662-44199-2_24,"PHAT – Persistent Homology Algorithms Toolbox"
11789,10.1007/978-3-662-44777-2_22,Online bipartite matching with decomposable weights
11790,10.1007/978-3-319-13129-0_4,Limiting price discrimination when selling products with positive network externalities
5810,10.1007/978-3-319-09955-2_33,"On Finding Spherical Geodesic Paths and Circles in ℤ3"
10897,10.1007/978-3-642-38221-5_19,Persistent homology in image processing
10902,10.1007/978-3-642-37064-9_20,How to travel between languages
5747,10.1007/978-3-642-39799-8_11,Automatic Linearizability Proofs of Concurrent Objects with Cooperating Updates
10903,10.1007/978-3-642-33386-6_14,Accurate invariant checking for programs manipulating lists and arrays with infinite data
10904,10.1007/978-3-642-32940-1_10,Strategy synthesis for multi-dimensional quantitative objectives
10905,10.1007/978-3-642-33090-2_27,Polynomial-time algorithms for energy games with special weight structures