The FacetedDBLP logo    Search for: in:

Disable automatic phrases ?     Syntactic query expansion: ?

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

URL (DBLP): http://dblp.uni-trier.de/db/journals/algorithmica

Publication years (Num. hits)
1986 (29) 1987 (27) 1988 (26) 1989 (36) 1990 (33) 1991 (47) 1992 (57) 1993 (58) 1994 (60) 1995 (54) 1996 (68) 1997 (79) 1998 (73) 1999 (68) 2000 (73) 2001 (89) 2002 (95) 2003 (53) 2004 (74) 2005 (54) 2006 (77) 2007 (77) 2008 (79) 2009 (96) 2010 (125) 2011 (133) 2012 (136) 2013 (108) 2014 (119) 2015 (130) 2016 (146) 2017 (158) 2018 (164) 2019 (161) 2020 (140) 2021 (129) 2022 (140) 2023 (137) 2024 (58)
Publication types (Num. hits)
article(3466)
Venues (Conferences, Journals, ...)
Algorithmica(3466)
GrowBag graphs for keyword ? (Num. hits/coverage)

Group by:
The graphs summarize 1597 occurrences of 761 keywords

Results
Found 3466 publication records. Showing 3466 according to the selection in the facets
Hits ? Authors Title Venue Year Link Author keywords
1Pranabendu Misra, Saket Saurabh 0001, Roohani Sharma, Meirav Zehavi Sub-exponential Time Parameterized Algorithms for Graph Layout Problems on Digraphs with Bounded Independence Number. Search on Bibsonomy Algorithmica The full citation details ... 2023 DBLP  DOI  BibTeX  RDF
1Sergey Bereg Computing Balanced Convex Partitions of Lines. Search on Bibsonomy Algorithmica The full citation details ... 2023 DBLP  DOI  BibTeX  RDF
1Harold N. Gabow A Weight-Scaling Algorithm for f-Factors of Multigraphs. Search on Bibsonomy Algorithmica The full citation details ... 2023 DBLP  DOI  BibTeX  RDF
1Pierre Aboulker, Édouard Bonnet, Eun Jung Kim 0002, Florian Sikora Grundy Coloring and Friends, Half-Graphs, Bicliques. Search on Bibsonomy Algorithmica The full citation details ... 2023 DBLP  DOI  BibTeX  RDF
1Júlio Araújo 0001, Julien Bensmail, Victor A. Campos, Frédéric Havet, Ana Karolinna Maia, Nicolas Nisse, Ana Silva 0001 On Finding the Best and Worst Orientations for the Metric Dimension. Search on Bibsonomy Algorithmica The full citation details ... 2023 DBLP  DOI  BibTeX  RDF
1Anthony Bonato, Konstantinos Georgiou, Calum MacRury, Pawel Pralat Algorithms for p-Faulty Search on a Half-Line. Search on Bibsonomy Algorithmica The full citation details ... 2023 DBLP  DOI  BibTeX  RDF
1Shyan Akmal, Ce Jin 0001 Near-Optimal Quantum Algorithms for String Problems. Search on Bibsonomy Algorithmica The full citation details ... 2023 DBLP  DOI  BibTeX  RDF
1Felix Reidl, Blair D. Sullivan A Color-Avoiding Approach to Subgraph Counting in Bounded Expansion Classes. Search on Bibsonomy Algorithmica The full citation details ... 2023 DBLP  DOI  BibTeX  RDF
1Manas Jyoti Kashyop, N. S. Narayanaswamy, Meghana Nasre, Sai Mohith Potluri Trade-Offs in Dynamic Coloring for Bipartite and General Graphs. Search on Bibsonomy Algorithmica The full citation details ... 2023 DBLP  DOI  BibTeX  RDF
1Alberto Del Pia, Silvia Di Gregorio On the Complexity of Binary Polynomial Optimization Over Acyclic Hypergraphs. Search on Bibsonomy Algorithmica The full citation details ... 2023 DBLP  DOI  BibTeX  RDF
1Shyan Akmal, Lijie Chen 0001, Ce Jin 0001, Malvika Raj, R. Ryan Williams Improved Merlin-Arthur Protocols for Central Problems in Fine-Grained Complexity. Search on Bibsonomy Algorithmica The full citation details ... 2023 DBLP  DOI  BibTeX  RDF
1Eyal Nussbaum, Michael Segal 0001, Oles Holembovskyy Finding Geometric Facilities with Location Privacy. Search on Bibsonomy Algorithmica The full citation details ... 2023 DBLP  DOI  BibTeX  RDF
1Bruno Pasqualotto Cavalar, Zhenjian Lu Algorithms and Lower Bounds for Comparator Circuits from Shrinkage. Search on Bibsonomy Algorithmica The full citation details ... 2023 DBLP  DOI  BibTeX  RDF
1Joshua Ani, Erik D. Demaine, Yevhenii Diomidov, Dylan H. Hendrickson, Jayson Lynch Traversability, Reconfiguration, and Reachability in the Gadget Framework. Search on Bibsonomy Algorithmica The full citation details ... 2023 DBLP  DOI  BibTeX  RDF
1Ben Cameron, Joe Sawada, Wei Therese, Aaron Williams Hamiltonicity of k-Sided Pancake Networks with Fixed-Spin: Efficient Generation, Ranking, and Optimality. Search on Bibsonomy Algorithmica The full citation details ... 2023 DBLP  DOI  BibTeX  RDF
1François Le Gall, Saeed Seddighin Quantum Meets Fine-Grained Complexity: Sublinear Time Quantum Algorithms for String Problems. Search on Bibsonomy Algorithmica The full citation details ... 2023 DBLP  DOI  BibTeX  RDF
1Patrizio Angelini, Michael A. Bekos, Henry Förster, Martin Gronemann Bitonic st-Orderings for Upward Planar Graphs: Splits and Bends in the Variable Embedding Scenario. Search on Bibsonomy Algorithmica The full citation details ... 2023 DBLP  DOI  BibTeX  RDF
1Kangsan Kim, Yongho Shin, Hyung-Chan An Constant-Factor Approximation Algorithms for Parity-Constrained Facility Location and k-Center. Search on Bibsonomy Algorithmica The full citation details ... 2023 DBLP  DOI  BibTeX  RDF
1Raghunath Reddy Madireddy, Apurva Mudgal A Constant-Factor Approximation Algorithm for Red-Blue Set Cover with Unit Disks. Search on Bibsonomy Algorithmica The full citation details ... 2023 DBLP  DOI  BibTeX  RDF
1Leah Epstein, Loay Mualem Online Bin Packing of Squares and Cubes. Search on Bibsonomy Algorithmica The full citation details ... 2023 DBLP  DOI  BibTeX  RDF
1Robert Krauthgamer, Shay Sapir Comparison of Matrix Norm Sparsification. Search on Bibsonomy Algorithmica The full citation details ... 2023 DBLP  DOI  BibTeX  RDF
1Sumanta Banerjee, Juhi Chaudhary, Dinabandhu Pradhan Unique Response Roman Domination: Complexity and Algorithms. Search on Bibsonomy Algorithmica The full citation details ... 2023 DBLP  DOI  BibTeX  RDF
1Deniz Agaoglu Çagirici, Petr Hlinený Efficient Isomorphism for Sd-Graphs and T-Graphs. Search on Bibsonomy Algorithmica The full citation details ... 2023 DBLP  DOI  BibTeX  RDF
1Till Fluschnik, Rolf Niedermeier, Carsten Schubert, Philipp Zschoche Multistage s-t Path: Confronting Similarity with Dissimilarity. Search on Bibsonomy Algorithmica The full citation details ... 2023 DBLP  DOI  BibTeX  RDF
1Arnold Filtser, Omrit Filtser, Matthew J. Katz Approximate Nearest Neighbor for Curves: Simple, Efficient, and Deterministic. Search on Bibsonomy Algorithmica The full citation details ... 2023 DBLP  DOI  BibTeX  RDF
1Sang Won Bae, Sang Duk Yoon Empty Squares in Arbitrary Orientation Among Points. Search on Bibsonomy Algorithmica The full citation details ... 2023 DBLP  DOI  BibTeX  RDF
1Stefan Klootwijk, Bodo Manthey Probabilistic Analysis of Optimization Problems on Sparse Random Shortest Path Metrics. Search on Bibsonomy Algorithmica The full citation details ... 2023 DBLP  DOI  BibTeX  RDF
1Susanne Albers, Waldo Gálvez, Maximilian Janke Machine Covering in the Random-Order Model. Search on Bibsonomy Algorithmica The full citation details ... 2023 DBLP  DOI  BibTeX  RDF
1Barnaby Martin, Daniël Paulusma, Siani Smith, Erik Jan van Leeuwen Induced Disjoint Paths and Connected Subgraphs for H-Free Graphs. Search on Bibsonomy Algorithmica The full citation details ... 2023 DBLP  DOI  BibTeX  RDF
1Jesse Beisegel, Ekkehard Köhler, Robert Scheffler 0001, Martin Strehler 0001 Certifying Fully Dynamic Algorithms for Recognition and Hamiltonicity of Threshold and Chain Graphs. Search on Bibsonomy Algorithmica The full citation details ... 2023 DBLP  DOI  BibTeX  RDF
1Kenya Kobayashi, Guohui Lin, Eiji Miyano, Toshiki Saitoh, Akira Suzuki, Tadatoshi Utashima, Tsuyoshi Yagita Path Cover Problems with Length Cost. Search on Bibsonomy Algorithmica The full citation details ... 2023 DBLP  DOI  BibTeX  RDF
1Sariel Har-Peled, Mitchell Jones Few Cuts Meet Many Point Sets. Search on Bibsonomy Algorithmica The full citation details ... 2023 DBLP  DOI  BibTeX  RDF
1David Eppstein A Stronger Lower Bound on Parametric Minimum Spanning Trees. Search on Bibsonomy Algorithmica The full citation details ... 2023 DBLP  DOI  BibTeX  RDF
1Balagopal Komarath, Anurag Pandey 0001, Chengot Sankaramenon Rahul Monotone Arithmetic Complexity of Graph Homomorphism Polynomials. Search on Bibsonomy Algorithmica The full citation details ... 2023 DBLP  DOI  BibTeX  RDF
1Peter Kiss Deterministic Dynamic Matching in Worst-Case Update Time. Search on Bibsonomy Algorithmica The full citation details ... 2023 DBLP  DOI  BibTeX  RDF
1Michael A. Bekos, Martin Gronemann, Chrysanthi N. Raftopoulou An Improved Upper Bound on the Queue Number of Planar Graphs. Search on Bibsonomy Algorithmica The full citation details ... 2023 DBLP  DOI  BibTeX  RDF
1Bogdan Alecu, Aistis Atminas, Vadim V. Lozin, Dmitriy S. Malyshev Combinatorics and Algorithms for Quasi-Chain Graphs. Search on Bibsonomy Algorithmica The full citation details ... 2023 DBLP  DOI  BibTeX  RDF
1Niccolò Di Marco, Andrea Frosini, William Lawrence Kocay, Elisa Pergola, Lama Tarsissi Structure and Complexity of 2-Intersection Graphs of 3-Hypergraphs. Search on Bibsonomy Algorithmica The full citation details ... 2023 DBLP  DOI  BibTeX  RDF
1Ioana O. Bercea, Guy Even Dynamic Dictionaries for Multisets and Counting Filters with Constant Time Operations. Search on Bibsonomy Algorithmica The full citation details ... 2023 DBLP  DOI  BibTeX  RDF
1Philip N. Klein, Claire Mathieu, Hang Zhou 0001 Correlation Clustering and Two-Edge-Connected Augmentation for Planar Graphs. Search on Bibsonomy Algorithmica The full citation details ... 2023 DBLP  DOI  BibTeX  RDF
1Sayan Bandyapadhyay, Aritra Banik, Sujoy Bhore On Colorful Vertex and Edge Cover Problems. Search on Bibsonomy Algorithmica The full citation details ... 2023 DBLP  DOI  BibTeX  RDF
1Félix Hernández, Gerardo Vega The Subfield and Extended Codes of a Subclass of Optimal Three-Weight Cyclic Codes. Search on Bibsonomy Algorithmica The full citation details ... 2023 DBLP  DOI  BibTeX  RDF
1Shunhua Jiang, Bento Natura, Omri Weinstein A Faster Interior-Point Method for Sum-of-Squares Optimization. Search on Bibsonomy Algorithmica The full citation details ... 2023 DBLP  DOI  BibTeX  RDF
1Anselm Haak, Arne Meier, Om Prakash 0002, B. V. Raghavendra Rao Parameterised Counting in Logspace. Search on Bibsonomy Algorithmica The full citation details ... 2023 DBLP  DOI  BibTeX  RDF
1Hiroshi Eto, Takehiro Ito, Eiji Miyano, Akira Suzuki, Yuma Tamura Happy Set Problem on Subclasses of Co-comparability Graphs. Search on Bibsonomy Algorithmica The full citation details ... 2023 DBLP  DOI  BibTeX  RDF
1Tomasz Kociumaka, Jakub Radoszewski, Tatiana Starikovskaya Publisher Correction: Longest Common Substring with Approximately k Mismatches. Search on Bibsonomy Algorithmica The full citation details ... 2023 DBLP  DOI  BibTeX  RDF
1Joe Sawada, Aaron Williams Constructing the first (and coolest) fixed-content universal cycle. Search on Bibsonomy Algorithmica The full citation details ... 2023 DBLP  DOI  BibTeX  RDF
1Nina Chiarelli, Matjaz Krnc, Martin Milanic, Ulrich Pferschy, Nevena Pivac, Joachim Schauer Fair Allocation of Indivisible Items with Conflict Graphs. Search on Bibsonomy Algorithmica The full citation details ... 2023 DBLP  DOI  BibTeX  RDF
1Carla Binucci, Giordano Da Lozzo, Emilio Di Giacomo, Walter Didimo, Tamara Mchedlidze, Maurizio Patrignani Upward Book Embeddability of st-Graphs: Complexity and Algorithms. Search on Bibsonomy Algorithmica The full citation details ... 2023 DBLP  DOI  BibTeX  RDF
1Riccardo Dondi, Manuel Lafond On the Tractability of Covering a Graph with 2-Clubs. Search on Bibsonomy Algorithmica The full citation details ... 2023 DBLP  DOI  BibTeX  RDF
1Ivan Bliznets, Danil Sagunov Solving Target Set Selection with Bounded Thresholds Faster than 2n. Search on Bibsonomy Algorithmica The full citation details ... 2023 DBLP  DOI  BibTeX  RDF
1Tomohiro Koana, Christian Komusiewicz, Frank Sommer Computing Dense and Sparse Subgraphs of Weakly Closed Graphs. Search on Bibsonomy Algorithmica The full citation details ... 2023 DBLP  DOI  BibTeX  RDF
1Amihood Amir, Ayelet Butman, Gad M. Landau, Shoshana Marcus, Dina Sokol Double String Tandem Repeats. Search on Bibsonomy Algorithmica The full citation details ... 2023 DBLP  DOI  BibTeX  RDF
1Yossi Azar, Chay Machluf, Boaz Patt-Shamir, Noam Touitou Competitive Vertex Recoloring. Search on Bibsonomy Algorithmica The full citation details ... 2023 DBLP  DOI  BibTeX  RDF
1Meng He 0001, Anna Lubiw, Mohammad R. Salavatipour Preface to the Special Issue on the 17th Algorithms and Data Structures Symposium (WADS 2021). Search on Bibsonomy Algorithmica The full citation details ... 2023 DBLP  DOI  BibTeX  RDF
1Sayan Bandyapadhyay Improved Bounds for Metric Capacitated Covering Problems. Search on Bibsonomy Algorithmica The full citation details ... 2023 DBLP  DOI  BibTeX  RDF
1Alexander Birx, Yann Disser, Kevin Schewior Improved Bounds for Open Online Dial-a-Ride on the Line. Search on Bibsonomy Algorithmica The full citation details ... 2023 DBLP  DOI  BibTeX  RDF
1Shlomi Dolev, Thomas Petig, Elad Michael Schiller Self-Stabilizing and Private Distributed Shared Atomic Memory in Seldomly Fair Message Passing Networks. Search on Bibsonomy Algorithmica The full citation details ... 2023 DBLP  DOI  BibTeX  RDF
1Hamidreza Jahanjou, Erez Kantor, Rajmohan Rajaraman Improved Algorithms for Scheduling Unsplittable Flows on Paths. Search on Bibsonomy Algorithmica The full citation details ... 2023 DBLP  DOI  BibTeX  RDF
1Md. Saidur Rahman 0001, Petra Mutzel, Slamin Special Issue Dedicated to 16th International Conference and Workshops on Algorithms and Computation, WALCOM 2022. Search on Bibsonomy Algorithmica The full citation details ... 2023 DBLP  DOI  BibTeX  RDF
1Muhammad Faisal Nadeem, Hamza Iqbal, Hafiz Muhammad Afzal Siddiqui, Muhammad Azeem 0002 Intersecting Longest Cycles in Archimedean Tilings. Search on Bibsonomy Algorithmica The full citation details ... 2023 DBLP  DOI  BibTeX  RDF
1Amey Bhangale, Aleksa Stankovic Max-3-Lin Over Non-abelian Groups with Universal Factor Graphs. Search on Bibsonomy Algorithmica The full citation details ... 2023 DBLP  DOI  BibTeX  RDF
1Matteo Castiglioni, Andrea Celli, Nicola Gatti 0001 Public Bayesian Persuasion: Being Almost Optimal and Almost Persuasive. Search on Bibsonomy Algorithmica The full citation details ... 2023 DBLP  DOI  BibTeX  RDF
1Spyros Angelopoulos 0001, Christoph Dürr, Shendan Jin Best-of-Both-Worlds Analysis of Online Search. Search on Bibsonomy Algorithmica The full citation details ... 2023 DBLP  DOI  BibTeX  RDF
1Pawel Gawrychowski, Przemyslaw Uznanski Better Distance Labeling for Unweighted Planar Graphs. Search on Bibsonomy Algorithmica The full citation details ... 2023 DBLP  DOI  BibTeX  RDF
1Amotz Bar-Noy, David Peleg, Mor Perry, Dror Rawitz Composed Degree-Distance Realizations of Graphs. Search on Bibsonomy Algorithmica The full citation details ... 2023 DBLP  DOI  BibTeX  RDF
1Gruia Calinescu, Xiaolang Wang Combination Algorithms for Steiner Tree Variants. Search on Bibsonomy Algorithmica The full citation details ... 2023 DBLP  DOI  BibTeX  RDF
1Thomas Bellitto, Shaohua Li 0005, Karolina Okrasa, Marcin Pilipczuk, Manuel Sorge The Complexity of Routing Problems in Forbidden-Transition Graphs and Edge-Colored Graphs. Search on Bibsonomy Algorithmica The full citation details ... 2023 DBLP  DOI  BibTeX  RDF
1Yoann Dieudonné, Andrzej Pelc, Franck Petit Almost Universal Anonymous Rendezvous in the Plane. Search on Bibsonomy Algorithmica The full citation details ... 2023 DBLP  DOI  BibTeX  RDF
1Amit Deshpande 0001, Rameshwar Pratap One-Pass Additive-Error Subset Selection for ℓ p Subspace Approximation and (k, p)-Clustering. Search on Bibsonomy Algorithmica The full citation details ... 2023 DBLP  DOI  BibTeX  RDF
1Andrea Marino 0001, Ana Silva 0001 Eulerian Walks in Temporal Graphs. Search on Bibsonomy Algorithmica The full citation details ... 2023 DBLP  DOI  BibTeX  RDF
1Max A. Deppert, Klaus Jansen, Arindam Khan 0001, Malin Rau, Malte Tutas Peak Demand Minimization via Sliced Strip Packing. Search on Bibsonomy Algorithmica The full citation details ... 2023 DBLP  DOI  BibTeX  RDF
1Sándor P. Fekete, Jonas Grosse-Holz, Phillip Keldenich, Arne Schmidt 0001 Parallel Online Algorithms for the Bin Packing Problem. Search on Bibsonomy Algorithmica The full citation details ... 2023 DBLP  DOI  BibTeX  RDF
1Guilherme C. M. Gomes, Matheus R. Guedes, Vinícius Fernandes dos Santos Structural Parameterizations for Equitable Coloring: Complexity, FPT Algorithms, and Kernelization. Search on Bibsonomy Algorithmica The full citation details ... 2023 DBLP  DOI  BibTeX  RDF
1Vincent Froese, Brijnesh J. Jain, Maciej Rymar, Mathias Weller Fast Exact Dynamic Time Warping on Run-Length Encoded Time Series. Search on Bibsonomy Algorithmica The full citation details ... 2023 DBLP  DOI  BibTeX  RDF
1Divesh Aggarwal, Nico Döttling, Jesko Dujmovic, Mohammad Hajiabadi, Giulio Malavolta, Maciej Obremski Algebraic Restriction Codes and Their Applications. Search on Bibsonomy Algorithmica The full citation details ... 2023 DBLP  DOI  BibTeX  RDF
1Alberto Rojas Anríquez, Maya Stein 3-Colouring Pt-Free Graphs Without Short Odd Cycles. Search on Bibsonomy Algorithmica The full citation details ... 2023 DBLP  DOI  BibTeX  RDF
1Serge Gaspers, Edward J. Lee Faster Graph Coloring in Polynomial Space. Search on Bibsonomy Algorithmica The full citation details ... 2023 DBLP  DOI  BibTeX  RDF
1Joyce Bacic, Saeed Mehrabi 0001, Michiel Smid Shortest Beer Path Queries in Outerplanar Graphs. Search on Bibsonomy Algorithmica The full citation details ... 2023 DBLP  DOI  BibTeX  RDF
1David Caballero, Timothy Gomez, Robert T. Schweller, Tim Wylie Unique Assembly Verification in Two-Handed Self-Assembly. Search on Bibsonomy Algorithmica The full citation details ... 2023 DBLP  DOI  BibTeX  RDF
1Moran Feldman, Zeev Nutov, Elad Shoham Practical Budgeted Submodular Maximization. Search on Bibsonomy Algorithmica The full citation details ... 2023 DBLP  DOI  BibTeX  RDF
1Konstantinos Tsakalidis, Sebastian Wild, Viktor Zamaraev Succinct Permutation Graphs. Search on Bibsonomy Algorithmica The full citation details ... 2023 DBLP  DOI  BibTeX  RDF
1Mark de Berg, Sándor Kisfaludi-Bak, Morteza Monemizadeh, Leonidas Theocharous Clique-Based Separators for Geometric Intersection Graphs. Search on Bibsonomy Algorithmica The full citation details ... 2023 DBLP  DOI  BibTeX  RDF
1Herbert Edelsbrunner, Georg Osang A Simple Algorithm for Higher-Order Delaunay Mosaics and Alpha Shapes. Search on Bibsonomy Algorithmica The full citation details ... 2023 DBLP  DOI  BibTeX  RDF
1Stefan Lendl, Gerhard J. Woeginger, Lasse Wulf Non-Preemptive Tree Packing. Search on Bibsonomy Algorithmica The full citation details ... 2023 DBLP  DOI  BibTeX  RDF
1Júlio Araújo 0001, Marin Bougeret, Victor A. Campos, Ignasi Sau Parameterized Complexity of Computing Maximum Minimal Blocking and Hitting Sets. Search on Bibsonomy Algorithmica The full citation details ... 2023 DBLP  DOI  BibTeX  RDF
1Waldo Gálvez, Fabrizio Grandoni 0001, Afrouz Jabal Ameli, Klaus Jansen, Arindam Khan 0001, Malin Rau A Tight (3/2+ε )-Approximation for Skewed Strip Packing. Search on Bibsonomy Algorithmica The full citation details ... 2023 DBLP  DOI  BibTeX  RDF
1Tomohiro Koana, Christian Komusiewicz, Frank Sommer Essentially Tight Kernels for (Weakly) Closed Graphs. Search on Bibsonomy Algorithmica The full citation details ... 2023 DBLP  DOI  BibTeX  RDF
1Sebastian Forster, Tijn de Vos Faster Cut Sparsification of Weighted Graphs. Search on Bibsonomy Algorithmica The full citation details ... 2023 DBLP  DOI  BibTeX  RDF
1Mincheol Kim, Chanyang Seo, Taehoon Ahn 0001, Hee-Kap Ahn Farthest-Point Voronoi Diagrams in the Presence of Rectangular Obstacles. Search on Bibsonomy Algorithmica The full citation details ... 2023 DBLP  DOI  BibTeX  RDF
1Sotiris E. Nikoletseas, Christoforos L. Raptopoulos, Paul G. Spirakis MAX CUT in Weighted Random Intersection Graphs and Discrepancy of Sparse Random Set Systems. Search on Bibsonomy Algorithmica The full citation details ... 2023 DBLP  DOI  BibTeX  RDF
1Yishu Wang 0002, Arnaud Mary, Marie-France Sagot, Blerina Sinaimeri A General Framework for Enumerating Equivalence Classes of Solutions. Search on Bibsonomy Algorithmica The full citation details ... 2023 DBLP  DOI  BibTeX  RDF
1Massimo Equi, Tuukka Norri, Jarno Alanko, Bastien Cazaux, Alexandru I. Tomescu, Veli Mäkinen Algorithms and Complexity on Indexing Founder Graphs. Search on Bibsonomy Algorithmica The full citation details ... 2023 DBLP  DOI  BibTeX  RDF
1Miroslaw Kowaluk, Andrzej Lingas Rare Siblings Speed-Up Deterministic Detection and Counting of Small Pattern Graphs. Search on Bibsonomy Algorithmica The full citation details ... 2023 DBLP  DOI  BibTeX  RDF
1Yiqin Gao, Yves Robert, Frédéric Vivien Resource-Constrained Scheduling Algorithms for Stochastic Independent Tasks With Unknown Probability Distribution. Search on Bibsonomy Algorithmica The full citation details ... 2023 DBLP  DOI  BibTeX  RDF
1Akanksha Agrawal 0001, Pranabendu Misra, Fahad Panolan, Saket Saurabh 0001 Fast Exact Algorithms for Survivable Network Design with Uniform Requirements. Search on Bibsonomy Algorithmica The full citation details ... 2022 DBLP  DOI  BibTeX  RDF
1Arnold Filtser, Ofer Neiman Light Spanners for High Dimensional Norms via Stochastic Decompositions. Search on Bibsonomy Algorithmica The full citation details ... 2022 DBLP  DOI  BibTeX  RDF
1Stefano Leucci 0001, Chih-Hung Liu 0001 Approximate Minimum Selection with Unreliable Comparisons. Search on Bibsonomy Algorithmica The full citation details ... 2022 DBLP  DOI  BibTeX  RDF
1Petr A. Golovach, Meirav Zehavi Special Issue Dedicated to the 16th International Symposium on Parameterized and Exact Computation. Search on Bibsonomy Algorithmica The full citation details ... 2022 DBLP  DOI  BibTeX  RDF
1Gabriel Bathie, Nicolas Bousquet, Yixin Cao 0001, Yuping Ke, Théo Pierron (Sub)linear Kernels for Edge Modification Problems Toward Structured Graph Classes. Search on Bibsonomy Algorithmica The full citation details ... 2022 DBLP  DOI  BibTeX  RDF
Displaying result #101 - #200 of 3466 (100 per page; Change: )
Pages: [<<][1][2][3][4][5][6][7][8][9][10][11][>>]
Valid XHTML 1.1! Valid CSS! [Valid RSS]
Maintained by L3S.
Previously maintained by Jörg Diederich.
Based upon DBLP by Michael Ley.
open data data released under the ODC-BY 1.0 license