The FacetedDBLP logo    Search for: in:

Disable automatic phrases ?     Syntactic query expansion: ?

Publications at "SODA"( http://dblp.L3S.de/Venues/SODA )

URL (DBLP): http://dblp.uni-trier.de/db/conf/soda

Publication years (Num. hits)
1990 (55) 1991 (54) 1992 (55) 1993 (56) 1994 (80) 1995 (71) 1996 (66) 1997 (86) 1998 (80) 1999 (168) 2000 (127) 2001 (129) 2002 (130) 2003 (116) 2004 (139) 2005 (138) 2006 (137) 2007 (140) 2008 (139) 2009 (139) 2010 (136) 2011 (137) 2012 (140) 2013 (136) 2014 (137) 2015 (137) 2016 (148) 2017 (183) 2018 (182) 2019 (185)
Publication types (Num. hits)
inproceedings(3596) proceedings(30)
Venues (Conferences, Journals, ...)
SODA(3626)
GrowBag graphs for keyword ? (Num. hits/coverage)

Group by:
The graphs summarize 167 occurrences of 134 keywords

Results
Found 3626 publication records. Showing 3626 according to the selection in the facets
Hits ? Authors Title Venue Year Link Author keywords
1Karim A. Adiprasito, Imre Bárány, Nabil H. Mustafa Theorems of Carathéodory, Helly, and Tverberg without dimension. Search on Bibsonomy SODA The full citation details ... 2019 DBLP  DOI  BibTeX  RDF
1Raphael Yuster Vector clique decompositions. Search on Bibsonomy SODA The full citation details ... 2019 DBLP  DOI  BibTeX  RDF
1Itai Ashlagi, Amin Saberi, Ali Shameli Assignment Mechanisms under Distributional Constraints. Search on Bibsonomy SODA The full citation details ... 2019 DBLP  DOI  BibTeX  RDF
1Martin Nägele, Rico Zenklusen A New Dynamic Programming Approach for Spanning Trees with Chain Constraints and Beyond. Search on Bibsonomy SODA The full citation details ... 2019 DBLP  DOI  BibTeX  RDF
1Karl Bringmann, Marvin Künnemann, André Nusser Fréchet Distance Under Translation: Conditional Hardness and an Algorithm via Offline Dynamic Grid Reachability. Search on Bibsonomy SODA The full citation details ... 2019 DBLP  DOI  BibTeX  RDF
1Yuan Deng, Debmalya Panigrahi Multi-unit Supply-monotone Auctions with Bayesian Valuations. Search on Bibsonomy SODA The full citation details ... 2019 DBLP  DOI  BibTeX  RDF
1Vijay Bhattiprolu, Mrinalkanti Ghosh, Venkatesan Guruswami, Euiwoong Lee, Madhur Tulsiani Approximability of p → q Matrix Norms: Generalized Krivine Rounding and Hypercontractive Hardness. Search on Bibsonomy SODA The full citation details ... 2019 DBLP  DOI  BibTeX  RDF
1Ruosong Wang, David P. Woodruff Tight Bounds for ℓp Oblivious Subspace Embeddings. Search on Bibsonomy SODA The full citation details ... 2019 DBLP  DOI  BibTeX  RDF
1 Front Matter. Search on Bibsonomy SODA The full citation details ... 2019 DBLP  DOI  BibTeX  RDF
1Wei-Kai Lin, Elaine Shi, Tiancheng Xie Can We Overcome the n log n Barrier for Oblivious Sorting? Search on Bibsonomy SODA The full citation details ... 2019 DBLP  DOI  BibTeX  RDF
1MohammadHossein Bateni, Alireza Farhadi 0001, MohammadTaghi Hajiaghayi Polynomial-time Approximation Scheme for Minimum k-cut in Planar and Minor-free Graphs. Search on Bibsonomy SODA The full citation details ... 2019 DBLP  DOI  BibTeX  RDF
1Sivakanth Gopi, Venkatesan Guruswami, Sergey Yekhanin Maximally Recoverable LRCs: A field size lower bound and constructions for few heavy parities. Search on Bibsonomy SODA The full citation details ... 2019 DBLP  DOI  BibTeX  RDF
1Kyriakos Axiotis, Arturs Backurs, Ce Jin, Christos Tzamos, Hongxun Wu Fast Modular Subset Sum using Linear Sketching. Search on Bibsonomy SODA The full citation details ... 2019 DBLP  DOI  BibTeX  RDF
1Andrej Bogdanov, Manuel Sabin, Prashant Nalini Vasudevan XOR Codes and Sparse Learning Parity with Noise. Search on Bibsonomy SODA The full citation details ... 2019 DBLP  DOI  BibTeX  RDF
1Ario Salmasi, Anastasios Sidiropoulos, Vijay Sridhar On Constant Multi-Commodity Flow-Cut Gaps for Families of Directed Minor-Free Graphs. Search on Bibsonomy SODA The full citation details ... 2019 DBLP  DOI  BibTeX  RDF
1Lijie Chen, Ryan Williams 0001 An Equivalence Class for Orthogonal Vectors. Search on Bibsonomy SODA The full citation details ... 2019 DBLP  DOI  BibTeX  RDF
1Michal Pilipczuk, Sebastian Siebertz Polynomial bounds for centered colorings on proper minor-closed graph classes. Search on Bibsonomy SODA The full citation details ... 2019 DBLP  DOI  BibTeX  RDF
1Pavel Veselý, Marek Chrobak, Lukasz Jez, Jirí Sgall A ϕ-Competitive Algorithm for Scheduling Packets with Deadlines. Search on Bibsonomy SODA The full citation details ... 2019 DBLP  DOI  BibTeX  RDF
1Merav Parter, Eylon Yogev Low Congestion Cycle Covers and Their Applications. Search on Bibsonomy SODA The full citation details ... 2019 DBLP  DOI  BibTeX  RDF
1Uriel Feige, Janardhan Kulkarni, Shi Li A Polynomial Time Constant Approximation For Minimizing Total Weighted Flow-time. Search on Bibsonomy SODA The full citation details ... 2019 DBLP  DOI  BibTeX  RDF
1Adrian Dumitrescu, Ritankar Mandal New Lower Bounds for the Number of Pseudoline Arrangements. Search on Bibsonomy SODA The full citation details ... 2019 DBLP  DOI  BibTeX  RDF
1Shunhua Jiang, Kasper Green Larsen A Faster External Memory Priority Queue with DecreaseKeys. Search on Bibsonomy SODA The full citation details ... 2019 DBLP  DOI  BibTeX  RDF
1Jose Balanza-Martinez, Austin Luchsinger, David Caballero, Rene Reyes, Angel A. Cantu, Robert T. Schweller, Luis Angel Garcia, Tim Wylie Full Tilt: Universal Constructors for General Shapes with Uniform External Forces. Search on Bibsonomy SODA The full citation details ... 2019 DBLP  DOI  BibTeX  RDF
1Maria-Florina Balcan, Yi Li, David P. Woodruff, Hongyang Zhang 0001 Testing Matrix Rank, Optimally. Search on Bibsonomy SODA The full citation details ... 2019 DBLP  DOI  BibTeX  RDF
1Elchanan Mossel, Jiaming Xu Seeded Graph Matching via Large Neighborhood Statistics. Search on Bibsonomy SODA The full citation details ... 2019 DBLP  DOI  BibTeX  RDF
1Jin-Yi Cai, Artem Govorov Perfect Matchings, Rank of Connection Tensors and Graph Homomorphisms. Search on Bibsonomy SODA The full citation details ... 2019 DBLP  DOI  BibTeX  RDF
1Rico Zenklusen A 1.5-Approximation for Path TSP. Search on Bibsonomy SODA The full citation details ... 2019 DBLP  DOI  BibTeX  RDF
1Kuan Cheng, Bernhard Haeupler, Xin Li, Amirbehshad Shahrasbi, Ke Wu Synchronization Strings: Highly Efficient Deterministic Constructions over Small Alphabets. Search on Bibsonomy SODA The full citation details ... 2019 DBLP  DOI  BibTeX  RDF
1Daniel Busto, William S. Evans, David G. Kirkpatrick Minimizing Interference Potential Among Moving Entities. Search on Bibsonomy SODA The full citation details ... 2019 DBLP  DOI  BibTeX  RDF
1Zhao Song, David P. Woodruff, Peilin Zhong Relative Error Tensor Low Rank Approximation. Search on Bibsonomy SODA The full citation details ... 2019 DBLP  DOI  BibTeX  RDF
1Sepehr Assadi, MohammadHossein Bateni, Aaron Bernstein, Vahab S. Mirrokni, Cliff Stein Coresets Meet EDCS: Algorithms for Matching and Vertex Cover on Massive Graphs. Search on Bibsonomy SODA The full citation details ... 2019 DBLP  DOI  BibTeX  RDF
1Deeksha Adil, Rasmus Kyng, Richard Peng, Sushant Sachdeva Iterative Refinement for ℓp-norm Regression. Search on Bibsonomy SODA The full citation details ... 2019 DBLP  DOI  BibTeX  RDF
1MohammadTaghi Hajiaghayi, Masoud Seddighin, Saeed Seddighin, Xiaorui Sun Approximating LCS in Linear Time: Beating the √n Barrier. Search on Bibsonomy SODA The full citation details ... 2019 DBLP  DOI  BibTeX  RDF
1Soheil Behnezhad, Alireza Farhadi 0001, MohammadTaghi Hajiaghayi, Nima Reyhani Stochastic Matching with Few Queries: New Algorithms and Tools. Search on Bibsonomy SODA The full citation details ... 2019 DBLP  DOI  BibTeX  RDF
1Glencora Borradaile, Hung Le, Christian Wulff-Nilsen Greedy spanners are optimal in doubling metrics. Search on Bibsonomy SODA The full citation details ... 2019 DBLP  DOI  BibTeX  RDF
1Moses Charikar, Vaggos Chatziafratis, Rad Niazadeh Hierarchical Clustering better than Average-Linkage. Search on Bibsonomy SODA The full citation details ... 2019 DBLP  DOI  BibTeX  RDF
1José R. Correa, Raimundo Saona, Bruno Ziliotto Prophet Secretary Through Blind Strategies. Search on Bibsonomy SODA The full citation details ... 2019 DBLP  DOI  BibTeX  RDF
1Tamal K. Dey Computing Height Persistence and Homology Generators in R3 Efficiently. Search on Bibsonomy SODA The full citation details ... 2019 DBLP  DOI  BibTeX  RDF
1Buddhima Gamlath, Sagar Kale, Ola Svensson Beating Greedy for Stochastic Bipartite Matching. Search on Bibsonomy SODA The full citation details ... 2019 DBLP  DOI  BibTeX  RDF
1Raphaël Clifford, Tomasz Kociumaka, Ely Porat The streaming k-mismatch problem. Search on Bibsonomy SODA The full citation details ... 2019 DBLP  DOI  BibTeX  RDF
1Irit Dinur, Prahladh Harsha, Tali Kaufman, Inbal Livni Navon, Amnon Ta-Shma List Decoding with Double Samplers. Search on Bibsonomy SODA The full citation details ... 2019 DBLP  DOI  BibTeX  RDF
1Santiago R. Balseiro, Vahab S. Mirrokni, Renato Paes Leme, Song Zuo Dynamic Double Auctions: Towards First Best. Search on Bibsonomy SODA The full citation details ... 2019 DBLP  DOI  BibTeX  RDF
1Arpit Agarwal, Sepehr Assadi, Sanjeev Khanna Stochastic Submodular Cover with Limited Adaptivity. Search on Bibsonomy SODA The full citation details ... 2019 DBLP  DOI  BibTeX  RDF
1Zhiyi Huang 0002, Binghui Peng, Zhihao Gavin Tang, Runzhou Tao, Xiaowei Wu, Yuhao Zhang Tight Competitive Ratios of Classic Matching Algorithms in the Fully Online Model. Search on Bibsonomy SODA The full citation details ... 2019 DBLP  DOI  BibTeX  RDF
1Timothy M. Chan (eds.) Proceedings of the Thirtieth Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2019, San Diego, California, USA, January 6-9, 2019 Search on Bibsonomy SODA The full citation details ... 2019 DBLP  DOI  BibTeX  RDF
1Michael A. Bender, Jake Christensen, Alex Conway, Martin Farach-Colton, Rob Johnson, Meng-Tsung Tsai Optimal Ball Recycling. Search on Bibsonomy SODA The full citation details ... 2019 DBLP  DOI  BibTeX  RDF
1Sushmita Gupta, Pranabendu Misra, Saket Saurabh 0001, Meirav Zehavi Popular Matching in Roommates Setting is NP-hard. Search on Bibsonomy SODA The full citation details ... 2019 DBLP  DOI  BibTeX  RDF
1Fabrizio Grandoni 0001, Stefano Leonardi, Piotr Sankowski, Chris Schwiegelshohn, Shay Solomon (1 + ε)-Approximate Incremental Matching in Constant Deterministic Amortized Time. Search on Bibsonomy SODA The full citation details ... 2019 DBLP  DOI  BibTeX  RDF
1Chandra Chekuri, Kent Quanrud On Approximating (Sparse) Covering Integer Programs. Search on Bibsonomy SODA The full citation details ... 2019 DBLP  DOI  BibTeX  RDF
1Aaron Bernstein, Sebastian Forster, Monika Henzinger A Deamortization Approach for Dynamic Spanner and Dynamic Maximal Matching. Search on Bibsonomy SODA The full citation details ... 2019 DBLP  DOI  BibTeX  RDF
1Matthew Jenssen, Peter Keevash, Will Perkins Algorithms for #BIS-hard problems on expander graphs. Search on Bibsonomy SODA The full citation details ... 2019 DBLP  DOI  BibTeX  RDF
1Karl Bringmann, Philip Wellnitz, Marvin Künnemann Few Matches or Almost Periodicity: Faster Pattern Matching with Mismatches in Compressed Texts. Search on Bibsonomy SODA The full citation details ... 2019 DBLP  DOI  BibTeX  RDF
1Sepehr Assadi, Krzysztof Onak, Baruch Schieber, Shay Solomon Fully Dynamic Maximal Independent Set with Sublinear in n Update Time. Search on Bibsonomy SODA The full citation details ... 2019 DBLP  DOI  BibTeX  RDF
1Nikhil Bansal, Raghu Meka On the discrepancy of random low degree set systems. Search on Bibsonomy SODA The full citation details ... 2019 DBLP  DOI  BibTeX  RDF
1Ran Duan, Haoqing He, Tianyi Zhang Dynamic Edge Coloring with Improved Approximation. Search on Bibsonomy SODA The full citation details ... 2019 DBLP  DOI  BibTeX  RDF
1Sepehr Assadi, Yu Chen, Sanjeev Khanna Sublinear Algorithms for (Δ + 1) Vertex Coloring. Search on Bibsonomy SODA The full citation details ... 2019 DBLP  DOI  BibTeX  RDF
1Matthew Fahrbach, Vahab S. Mirrokni, Morteza Zadimoghaddam Submodular Maximization with Nearly Optimal Approximation, Adaptivity and Query Complexity. Search on Bibsonomy SODA The full citation details ... 2019 DBLP  DOI  BibTeX  RDF
1Eunjin Oh 0001 Optimal Algorithm for Geodesic Nearest-point Voronoi Diagrams in Simple Polygons. Search on Bibsonomy SODA The full citation details ... 2019 DBLP  DOI  BibTeX  RDF
1Mark Bun, Robin Kothari, Justin Thaler Quantum algorithms and approximating polynomials for composed functions with shared inputs. Search on Bibsonomy SODA The full citation details ... 2019 DBLP  DOI  BibTeX  RDF
1Sitan Chen, Michelle Delcourt, Ankur Moitra, Guillem Perarnau, Luke Postle Improved Bounds for Randomly Sampling Colorings via Linear Programming. Search on Bibsonomy SODA The full citation details ... 2019 DBLP  DOI  BibTeX  RDF
1Xue Chen Derandomized Balanced Allocation. Search on Bibsonomy SODA The full citation details ... 2019 DBLP  DOI  BibTeX  RDF
1Wouter Cames van Batenburg, Tony Huynh, Gwenaël Joret, Jean-Florent Raymond A tight Erdős-Pósa function for planar minors. Search on Bibsonomy SODA The full citation details ... 2019 DBLP  DOI  BibTeX  RDF
1Max Klimm, Philipp Warode Computing all Wardrop Equilibria parametrized by the Flow Demand. Search on Bibsonomy SODA The full citation details ... 2019 DBLP  DOI  BibTeX  RDF
1Antonios Antoniadis, Krzysztof Fleszar 0001, Ruben Hoeksma, Kevin Schewior A PTAS for Euclidean TSP with Hyperplane Neighborhoods. Search on Bibsonomy SODA The full citation details ... 2019 DBLP  DOI  BibTeX  RDF
1Eric Balkanski, Aviad Rubinstein, Yaron Singer An Exponential Speedup in Parallel Running Time for Submodular Maximization without Loss in Approximation. Search on Bibsonomy SODA The full citation details ... 2019 DBLP  DOI  BibTeX  RDF
1Aleksandar Nikolov, Mohit Singh, Uthaipon Tao Tantipongpipat Proportional Volume Sampling and Approximation Algorithms for A-Optimal Design. Search on Bibsonomy SODA The full citation details ... 2019 DBLP  DOI  BibTeX  RDF
1Andris Ambainis, Kaspars Balodis, Janis Iraids, Martins Kokainis, Krisjanis Prusis, Jevgenijs Vihrovs Quantum Speedups for Exponential-Time Dynamic Programming Algorithms. Search on Bibsonomy SODA The full citation details ... 2019 DBLP  DOI  BibTeX  RDF
1Charles Carlson, Alexandra Kolla, Nikhil Srivastava, Luca Trevisan Optimal Lower Bounds for Sketching Graph Cuts. Search on Bibsonomy SODA The full citation details ... 2019 DBLP  DOI  BibTeX  RDF
1Nathaniel Harms Testing Halfspaces over Rotation-Invariant Distributions. Search on Bibsonomy SODA The full citation details ... 2019 DBLP  DOI  BibTeX  RDF
1Jaroslaw Blasiok, Mark Bun, Aleksandar Nikolov, Thomas Steinke Towards Instance-Optimal Private Query Release. Search on Bibsonomy SODA The full citation details ... 2019 DBLP  DOI  BibTeX  RDF
1Sándor Kisfaludi-Bak, Jesper Nederlof, Erik Jan van Leeuwen Nearly ETH-tight algorithms for Planar Steiner Tree with Terminals on Few Faces. Search on Bibsonomy SODA The full citation details ... 2019 DBLP  DOI  BibTeX  RDF
1Thatchaphol Saranurak, Di Wang Expander Decomposition and Pruning: Faster, Stronger, and Simpler. Search on Bibsonomy SODA The full citation details ... 2019 DBLP  DOI  BibTeX  RDF
1Vida Dujmovic, Fabrizio Frati, Daniel Gonçalves 0002, Pat Morin, Günter Rote Every Collinear Set in a Planar Graph Is Free. Search on Bibsonomy SODA The full citation details ... 2019 DBLP  DOI  BibTeX  RDF
1Yeow Meng Chee, Duc Tu Dao, Han Mao Kiah, San Ling, Hengjia Wei Binary Robust Positioning Patterns with Low Redundancy and Efficient Locating Algorithms. Search on Bibsonomy SODA The full citation details ... 2019 DBLP  DOI  BibTeX  RDF
1Gianfranco Bilardi, Lorenzo De Stefani The I/O complexity of Toom-Cook integer multiplication. Search on Bibsonomy SODA The full citation details ... 2019 DBLP  DOI  BibTeX  RDF
1Caleb C. Levy, Robert E. Tarjan A New Path from Splay to Dynamic Optimality. Search on Bibsonomy SODA The full citation details ... 2019 DBLP  DOI  BibTeX  RDF
1Rebecca Reiffenhäuser An Optimal Truthful Mechanism for the Online Weighted Bipartite Matching Problem. Search on Bibsonomy SODA The full citation details ... 2019 DBLP  DOI  BibTeX  RDF
1Rohit Gurjar, Nisheeth K. Vishnoi On the Number of Circuits in Regular Matroids (with Connections to Lattices and Codes). Search on Bibsonomy SODA The full citation details ... 2019 DBLP  DOI  BibTeX  RDF
1Benjamin Plaut, Tim Roughgarden Communication Complexity of Discrete Fair Division. Search on Bibsonomy SODA The full citation details ... 2019 DBLP  DOI  BibTeX  RDF
1Colin Cooper, Alan M. Frieze, Wesley Pegden On the rank of a random binary matrix. Search on Bibsonomy SODA The full citation details ... 2019 DBLP  DOI  BibTeX  RDF
1Marco Molinaro Stochastic ℓp Load Balancing and Moment Problems via the L-Function Method. Search on Bibsonomy SODA The full citation details ... 2019 DBLP  DOI  BibTeX  RDF
1Georgios Amanatidis, Pieter Kleer Rapid Mixing of the Switch Markov Chain for Strongly Stable Degree Sequences and 2-Class Joint Degree Matrices. Search on Bibsonomy SODA The full citation details ... 2019 DBLP  DOI  BibTeX  RDF
1Madhu Sudan, Badih Ghazi, Noah Golowich, Mitali Bafna Communication-Rounds Tradeoffs for Common Randomness and Secret Key Generation. Search on Bibsonomy SODA The full citation details ... 2019 DBLP  DOI  BibTeX  RDF
1T.-H. Hubert Chan, Kai-Min Chung, Bruce M. Maggs, Elaine Shi Foundations of Differentially Oblivious Algorithms. Search on Bibsonomy SODA The full citation details ... 2019 DBLP  DOI  BibTeX  RDF
1Chandra Chekuri, Kent Quanrud Submodular Function Maximization in Parallel via the Multilinear Relaxation. Search on Bibsonomy SODA The full citation details ... 2019 DBLP  DOI  BibTeX  RDF
1Dominik Kempa Optimal Construction of Compressed Indexes for Highly Repetitive Texts. Search on Bibsonomy SODA The full citation details ... 2019 DBLP  DOI  BibTeX  RDF
1William Kuszmaul Efficiently Approximating Edit Distance Between Pseudorandom Strings. Search on Bibsonomy SODA The full citation details ... 2019 DBLP  DOI  BibTeX  RDF
1Niv Buchbinder, Moran Feldman, Mohit Garg 0003 Deterministic (½ + ε)-Approximation for Submodular Maximization over a Matroid. Search on Bibsonomy SODA The full citation details ... 2019 DBLP  DOI  BibTeX  RDF
1Frank Ban, Vijay Bhattiprolu, Karl Bringmann, Pavel Kolev, Euiwoong Lee, David P. Woodruff A PTAS for ℓp-Low Rank Approximation. Search on Bibsonomy SODA The full citation details ... 2019 DBLP  DOI  BibTeX  RDF
1Úlfar Erlingsson, Vitaly Feldman, Ilya Mironov, Ananth Raghunathan, Kunal Talwar, Abhradeep Thakurta Amplification by Shuffling: From Local to Central Differential Privacy via Anonymity. Search on Bibsonomy SODA The full citation details ... 2019 DBLP  DOI  BibTeX  RDF
1Sam Buss, Alexander Knop Strategies for Stable Merge Sorting. Search on Bibsonomy SODA The full citation details ... 2019 DBLP  DOI  BibTeX  RDF
1Mrinal Kumar 0001, Ramprasad Saptharishi, Anamay Tengse Near-optimal Bootstrapping of Hitting Sets for Algebraic Circuits. Search on Bibsonomy SODA The full citation details ... 2019 DBLP  DOI  BibTeX  RDF
1Alexander Wei Optimal Las Vegas Approximate Near Neighbors in ℓp. Search on Bibsonomy SODA The full citation details ... 2019 DBLP  DOI  BibTeX  RDF
1André Berger, László Kozma 0002, Matthias Mnich, Roland Vincze A time- and space-optimal algorithm for the many-visits TSP. Search on Bibsonomy SODA The full citation details ... 2019 DBLP  DOI  BibTeX  RDF
1Panagiotis Charalampopoulos, Shay Mozes, Benjamin Tebeka Exact Distance Oracles for Planar Graphs with Failing Vertices. Search on Bibsonomy SODA The full citation details ... 2019 DBLP  DOI  BibTeX  RDF
1Andrzej Grzesik, Tereza Klimosova, Marcin Pilipczuk, Michal Pilipczuk Polynomial-time algorithm for Maximum Weight Independent Set on P6-free graphs. Search on Bibsonomy SODA The full citation details ... 2019 DBLP  DOI  BibTeX  RDF
1Prasad Raghavendra, Nick Ryder, Nikhil Srivastava, Benjamin Weitz Exponential Lower Bounds on Spectrahedral Representations of Hyperbolicity Cones. Search on Bibsonomy SODA The full citation details ... 2019 DBLP  DOI  BibTeX  RDF
1Ulrich Bauer, Abhishek Rathod Hardness of Approximation for Morse Matching. Search on Bibsonomy SODA The full citation details ... 2019 DBLP  DOI  BibTeX  RDF
1Akanksha Agrawal, Pranabendu Misra, Saket Saurabh 0001, Meirav Zehavi Interval Vertex Deletion Admits a Polynomial Kernel. Search on Bibsonomy SODA The full citation details ... 2019 DBLP  DOI  BibTeX  RDF
1Haim Kaplan, Or Zamir, Uri Zwick A sort of an adversary. Search on Bibsonomy SODA The full citation details ... 2019 DBLP  DOI  BibTeX  RDF
Displaying result #1 - #100 of 3626 (100 per page; Change: )
Pages: [1][2][3][4][5][6][7][8][9][10][>>]
Valid XHTML 1.1! Valid CSS! [Valid RSS]
Maintained by Jörg Diederich.
Based upon DBLP by Michael Ley.
open data data released under the ODC-BY 1.0 license