cs.DM

Papers

• Searching in trees with $k$-up-modular cost functions (2025)
  Micha{\l} Szyfelbein
  2.26
• Average Shortest Path Length of Graphs of Diameter 3 (2016)
  Nobutaka Shimizu et al.
  —
• Local Search for Max-Sum Diversification (2016)
  Alfonso Cevallos et al.
  —
• A local search 2.917-approximation algorithm for duo-preservation string mapping (2017)
  Yao Xu et al.
  —
• New algorithms for the Minimum Coloring Cut Problem (2017)
  Augusto Bordini and F\'abio Protti
  —
• The $\mathcal{E}$-Average Common Submatrix: Approximate Searching in a Restricted Neighborhood (2017)
  Alessia Amelio and Darko Brodi\'c
  —
• When data mining meets optimization: A case study on the quadratic assignment problem (2017)
  Yangming Zhou et al.
  —
• Randomized Near Neighbor Graphs, Giant Components, and Applications in Data Science (2017)
  George C. Linderman et al.
  —
• A Model of Optimal Network Structure for Decentralized Nearest Neighbor Search (2017)
  Alexander Ponomarenko et al.
  —
• Probabilistic Tools for the Analysis of Randomized Optimization Heuristics (2021)
  Benjamin Doerr
  —
• A Tight Extremal Bound on the Lov\'{a}sz Cactus Number in Planar Graphs (2019)
  Parinya Chalermsook et al.
  —
• Fault Tolerant and Fully Dynamic DFS in Undirected Graphs: Simple Yet Efficient (2019)
  Surender Baswana et al.
  —
• Efficiently list-edge coloring multigraphs asymptotically optimally (2021)
  Fotis Iliopoulos and Alistair Sinclair
  —
• Making a Sieve Random: Improved Semi-Streaming Algorithm for Submodular Maximization under a Cardinality Constraint (2019)
  Naor Alaluf and Moran Feldman
  —
• Enumeration of Preferred Extensions in Almost Oriented Digraphs (2019)
  Serge Gaspers and Ray Li
  —
• Steepest ascent can be exponential in bounded treewidth problems (2020)
  David A. Cohen et al.
  —
• Exact and approximation algorithms for the expanding search problem (2019)
  Ben Hermans et al.
  —
• Tree search algorithms for the Sequential Ordering Problem (2020)
  Luc Libralesso (G-SCOP_ROSP) et al.
  —
• Mixed Integer Programming for Searching Maximum Quasi-Bicliques (2020)
  Dmitry I. Ignatov et al.
  —
• A polynomial time algorithm to compute the connected tree-width of a series-parallel graph (2021)
  Guillaume Mescoff et al.
  —
• An Algorithm for the Exact Treedepth Problem (2020)
  James Trimble
  —
• Efficient enumeration of maximal split subgraphs and induced sub-cographs and related classes (2023)
  Caroline Brosse et al.
  —
• Searching and Sorting with O(n^2) processors in O(1) time (2020)
  Taeyoung An and A. Yavuz Oruc
  —
• The Complexity of Bicriteria Tree-Depth (2021)
  Piotr Borowiecki et al.
  —
• Hyperbolicity Computation through Dominating Sets (2021)
  David Coudert (COATI) et al.
  —
• Algorithms with improved delay for enumerating connected induced subgraphs of a large cardinality (2023)
  Shanshan Wang et al.
  —
• Graph Search Trees and Their Leaves (2023)
  Robert Scheffler
  —
• K-Shortest Simple Paths Using Biobjective Path Search (2023)
  Pedro Maristany de las Casas and Antonio Sede\~no-Noda and Ralf Bornd\"orfer and Max Huneshagen
  —
• Finding Increasingly Large Extremal Graphs with AlphaZero and Tabu Search (2024)
  Abbas Mehrabian et al.
  —
• Searching in trees with monotonic query times (2024)
  Dariusz Dereniowski and Izajasz Wrosz
  —
• The Bottom-Left Algorithm for the Strip Packing Problem (2024)
  Stefan Hougardy and Bart Zondervan
  —
• An algorithm with a delay of $\mathcal{O}(k\Delta)$ for enumerating connected induced subgraphs of size $k$ (2025)
  Chenglong Xiao et al.
  —
• On multidimensional generalization of binary search (2024)
  Dariusz Dereniowski et al.
  —
• Graph Search Trees and the Intermezzo Problem (2024)
  Jesse Beisegel et al.
  —
• Local search for valued constraint satisfaction parameterized by treedepth (2024)
  Artem Kaznatcheev
  —
• Deterministic Algorithm and Faster Algorithm for Submodular Maximization subject to a Matroid Constraint (2025)
  Niv Buchbinder and Moran Feldman
  —
• Approximately covering vertices by order-$5$ or longer paths (2024)
  Mingyang Gong et al.
  —
• A Tie-breaking based Local Search Algorithm for Stable Matching Problems (2025)
  Junyuan Qiu
  —
• Efficient Local and Tabu Search Strategies for Large-Scale Quadratic Integer Programming (2025)
  Haibo Wang and Bahram Alidaee
  —
• Neural Networks and (Virtual) Extended Formulations (2026)
  Christoph Hertrich et al.
  —
• Approximation algorithms for non-sequential star packing problems (2024)
  Mengyuan Hu et al.
  —
• Functional design of efficient and parallelizable combinatorial generators using convolution (2026)
  Xi He et al.
  —
• Dynamic Necklace Splitting (2026)
  Rishi Advani et al.
  —
• Robust Permutation Flowshops Under Budgeted Uncertainty (2026)
  Noam Goldberg et al.
  —
• Breadth-First Search Trees with Many or Few Leaves (2026)
  Jesse Beisegel et al.
  —
• Faster Mixing for Triangulations via Transport Flows (2026)
  Vedat Levi Alev et al.
  —
• Entropy Equivalence Testing (2026)
  Cl\'ement L. Canonne et al.
  —
• Soft Tuy-Completeness for Robust Projection Selection in Cone-Beam CT (2026)
  Linda-Sophie Schneider et al.
  —
• Efficient Uniform Sampling of Surjections via their Profiles (2026)
  Arnaud Carayol et al.
  —
• A Tight Bound on Localization of Electrical Flows (2026)
  Ori Gurel-Gurevich et al.
  —