Found: 17
Select item for more details and to access through your institution.
Satiation in Fisher Markets and Approximation of Nash Social Welfare.
- Published in:
- Mathematics of Operations Research, 2024, v. 49, n. 2, p. 1109, doi. 10.1287/moor.2019.0129
- By:
- Publication type:
- Article
Fair Division of Indivisible Goods for a Class of Concave Valuations.
- Published in:
- Journal of Artificial Intelligence Research, 2022, v. 74, p. 111, doi. 10.1613/jair.1.12911
- By:
- Publication type:
- Article
The Maximum-Level Vertex in an Arrangement of Lines.
- Published in:
- Discrete & Computational Geometry, 2022, v. 67, n. 2, p. 439, doi. 10.1007/s00454-021-00338-9
- By:
- Publication type:
- Article
Towards More Practical Linear Programming-based Techniques for Algorithmic Mechanism Design.
- Published in:
- Theory of Computing Systems, 2016, v. 59, n. 4, p. 641, doi. 10.1007/s00224-016-9704-2
- By:
- Publication type:
- Article
Algorithms and Programs.
- Published in:
- European Review, 2016, v. 24, n. 1, p. 4, doi. 10.1017/S1062798715000381
- By:
- Publication type:
- Article
Every DFS Tree of a 3-Connected Graph Contains a Contractible Edge.
- Published in:
- Journal of Graph Theory, 2013, v. 72, n. 1, p. 112, doi. 10.1002/jgt.21635
- By:
- Publication type:
- Article
Weisfeiler-Lehman Graph Kernels.
- Published in:
- Journal of Machine Learning Research, 2012, v. 13, n. 9, p. 2539
- By:
- Publication type:
- Article
Weisfeiler-Lehman Graph Kernels.
- Published in:
- Journal of Machine Learning Research, 2011, v. 12, n. 9, p. 2539
- By:
- Publication type:
- Article
Algorithms to Compute Minimum Cycle Basis in Directed Graphs.
- Published in:
- Theory of Computing Systems, 2007, v. 41, n. 1, p. 485, doi. 10.1007/s00224-006-1319-6
- By:
- Publication type:
- Article
POLYLINE FITTING OF PLANAR POINTS UNDER MIN-SUM CRITERIA.
- Published in:
- International Journal of Computational Geometry & Applications, 2006, v. 16, n. 2/3, p. 97, doi. 10.1142/S0218195906001951
- By:
- Publication type:
- Article
Matching Algorithms Are Fast in Sparse Random Graphs.
- Published in:
- Theory of Computing Systems, 2006, v. 39, n. 1, p. 3, doi. 10.1007/s00224-005-1254-y
- By:
- Publication type:
- Article
INFIMAXIMAL FRAMES: A TECHNIQUE FOR MAKING LINES LOOK LIKE SEGMENTS.
- Published in:
- International Journal of Computational Geometry & Applications, 2003, v. 13, n. 3, p. 241, doi. 10.1142/S0218195903001141
- By:
- Publication type:
- Article
Furthest Site Abstract Voronoi Diagrams.
- Published in:
- International Journal of Computational Geometry & Applications, 2001, v. 11, n. 6, p. 583, doi. 10.1142/S0218195901000663
- By:
- Publication type:
- Article
Average-case complexity of shortest-paths problems in the vertex-potential model.
- Published in:
- Random Structures & Algorithms, 2000, v. 16, n. 1, p. 33, doi. 10.1002/(SICI)1098-2418(200001)16:1<33::AID-RSA3>3.0.CO;2-0
- By:
- Publication type:
- Article
On the Expected Depth of Random Circuits.
- Published in:
- Combinatorics, Probability & Computing, 1999, v. 8, n. 3, p. 209, doi. 10.1017/s096354839900382x
- By:
- Publication type:
- Article
On the all-pairs shortest-path algorithm of Moffat and Takaoka.
- Published in:
- Random Structures & Algorithms, 1997, v. 10, n. 1/2, p. 205, doi. 10.1002/(SICI)1098-2418(199701/03)10:1/2<205::AID-RSA11>3.0.CO;2-7
- By:
- Publication type:
- Article
Zur elektrolytischen Reduktion des Sauerstoffes zu Wasserstoffsuperoxyd.
- Published in:
- Zeitschrift für Anorganische und Allgemeine Chemie, 1935, v. 223, n. 2, p. 199, doi. 10.1002/zaac.19352230213
- By:
- Publication type:
- Article