Hermes: Scalable and Robust Structure-Aware Optimal Routing for Decentralized Exchanges

Authors: Farokhnia, Soroush, Novozhilov, Sergei, Safaei, Sanaz, Shen, Jiasi

Source: 2025 IEEE International Conference on Blockchain (Blockchain) BLOCKCHAIN Blockchain (Blockchain), 2025 IEEE International Conference on. :199-206 Oct, 2025

Relation: 2025 IEEE International Conference on Blockchain (Blockchain)

Parameterized Max Min Feedback Vertex Set

Authors: Michael Lampis, Nikolaos Melissinos, Manolis Vasilakis

Contributors: Michael Lampis and Nikolaos Melissinos and Manolis Vasilakis

Source: SIAM Journal on Discrete Mathematics. 39:1587-1620

Subject Terms: FOS: Computer and information sciences, Parameterized algorithms, Computer Science - Computational Complexity, ETH, Treewidth, Computer Science - Data Structures and Algorithms, Data Structures and Algorithms (cs.DS), 0102 computer and information sciences, ddc:004, Computational Complexity (cs.CC), Feedback vertex set, 01 natural sciences

File Description: application/pdf

Access URL: http://arxiv.org/abs/2302.09604
https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.MFCS.2023.62

String Consensus Problems with Swaps and Substitutions

Authors: Gabory, Estéban^Aff11, Bulteau, Laurent^Aff12, Fici, Gabriele^Aff11, Verbeek, Hilde^Aff13

Contributors: Goos, Gerhard, Founding Editor^Aff1, Hartmanis, Juris, Founding Editor^Aff2, Bertino, Elisa, Series Editor^Aff3, Gao, Wen, Series Editor^Aff4, Steffen, Bernhard, Series Editor^Aff5, Yung, Moti, Series Editor^Aff6, Badkobeh, Golnaz, editor^Aff7, Radoszewski, Jakub, editor^Aff8, Tonellotto, Nicola, editor^Aff9, Baeza-Yates, Ricardo, editor^Aff10

Source: String Processing and Information Retrieval : 32nd International Symposium, SPIRE 2025, London, UK, September 8–11, 2025, Proceedings. 16073:133-147

Parameterized Restless Temporal Path

Authors: Cauvi, Justine^{Aff9, Aff10}, Viennot, Laurent^Aff9

Contributors: Hartmanis, Juris, Founding Editor^Aff1, Goos, Gerhard, Founding Editor^Aff2, Bertino, Elisa, Series Editor^Aff3, Gao, Wen, Series Editor^Aff4, Steffen, Bernhard, Series Editor^Aff5, Yung, Moti, Series Editor^Aff6, Jeż, Artur, editor^Aff7, Otop, Jan, editor^Aff8

Source: Fundamentals of Computation Theory : 25th International Symposium, FCT 2025, Wrocław, Poland, September 15–17, 2025, Proceedings. 16106:82-93

Computing Tree Decompositions with Small Independence Number

Authors: Clément Dallard, Fedor V. Fomin, Petr A. Golovach, Tuukka Korhonen, Martin Milanič

Contributors: Clément Dallard and Fedor V. Fomin and Petr A. Golovach and Tuukka Korhonen and Martin Milanič

Source: Leibniz International Proceedings in Informatics
51:1-51:18

Subject Terms: FOS: Computer and information sciences, parameterized algorithms, Data Structures and Algorithms, Combinatorics, FOS: Mathematics, Data Structures and Algorithms (cs.DS), tree-independence number, 0102 computer and information sciences, Combinatorics (math.CO), ddc:004, approximation, 01 natural sciences

File Description: application/pdf

Access URL: http://arxiv.org/abs/2207.09993
https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ICALP.2024.51
https://hdl.handle.net/11250/3185366

Twin-Width III: Max Independent Set, Min Dominating Set, and Coloring

Authors: Bonnet, Édouard, Geniet, Colin, Kim, Eun Jung, Thomassé, Stéphan, Watrigant, Rémi

Contributors: Édouard Bonnet and Colin Geniet and Eun Jung Kim and Stéphan Thomassé and Rémi Watrigant, Kim, Eunjung, Thomassé, Stéphan

Source: SIAM Journal on Computing. 53:1602-1640

Subject Terms: FOS: Computer and information sciences, Parameterized Algorithms, Discrete Mathematics (cs.DM), 0102 computer and information sciences, [INFO] Computer Science [cs], Computational Complexity (cs.CC), Exact Algorithms, 01 natural sciences, Max Independent Set, Min Dominating Set, Computer Science - Computational Complexity, Computer Science - Data Structures and Algorithms, FOS: Mathematics, Coloring, Mathematics - Combinatorics, Data Structures and Algorithms (cs.DS), 05C85, Combinatorics (math.CO), ddc:004, F.2.2, Approximation Algorithms, Twin-width, Computer Science - Discrete Mathematics

File Description: application/pdf

Access URL: http://arxiv.org/abs/2007.14161
https://dblp.uni-trier.de/db/journals/corr/corr2007.html#abs-2007-14161
http://ui.adsabs.harvard.edu/abs/2020arXiv200714161B/abstract
https://arxiv.org/abs/2007.14161
https://arxiv.org/pdf/2007.14161v1
https://basepub.dauphine.psl.eu/handle/123456789/22127
https://drops.dagstuhl.de/opus/volltexte/2021/14104/
https://dblp.uni-trier.de/db/conf/icalp/icalp2021.html#BonnetG0TW21
https://drops.dagstuhl.de/opus/volltexte/2021/14104/pdf/LIPIcs-ICALP-2021-35.pdf/
https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ICALP.2021.35

Tight Complexity Bounds for Counting Generalized Dominating Sets in Bounded-Treewidth Graphs—Part I: Algorithmic Results

Authors: Focke, Jacob, Marx, Dániel, Mc Inerney, Fionn, Neuen, Daniel, Sankar, Govind S., Schepper, Philipp, Wellnitz, Philip

Source: ACM Transactions on Algorithms. 21(3):1-45

Availability: http://dl.acm.org/doi/10.1145/3731452

Assigning times to minimise reachability in temporal graphs

Authors: Enright, Jessica, Meeks, Kitty, Skerman, Fiona

Source: Journal of computer and system sciences (Print). 115:169-186

Subject Terms: Graph modification, Graph contagion, Influence spreading, Temporal paths, Parameterized algorithms

File Description: electronic

Access URL: https://urn.kb.se/resolve?urn=urn:nbn:se:uu:diva-424498
https://doi.org/10.1016/j.jcss.2020.08.001

On the parameterized complexity of computing tree-partitions

Authors: Bodlaender, Hans L., Groenland, Carla, Jacob, Hugo

Contributors: Hans L. Bodlaender and Carla Groenland and Hugo Jacob, Sub Algorithms and Complexity, Sub Mathematical Modeling, Algorithms and Complexity, Dell, Holger, Nederlof, Jesper

Source: Discrete Mathematics & Theoretical Computer Science, Vol vol. 26:3, Iss Discrete Algorithms (2025)
IPEC
17th International Symposium on Parameterized and Exact Computation (IPEC 2022)

Subject Terms: FOS: Computer and information sciences, Domino Treewidth, parameterized algorithms, Discrete Mathematics (cs.DM), Treewidth, 0102 computer and information sciences, 01 natural sciences, Parameterized algorithms, Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.), Graph algorithms (graph-theoretic aspects), QA1-939, treewidth, tree-partition-width, approximation algorithms, parameterized complexity, tree-partitions, Approximation algorithms, computer science - discrete mathematics, tree-cut width, Tree partitions, ddc:004, domino treewidth, Approximation Algorithms, Software, Mathematics, Parameterized Complexity, Computer Science - Discrete Mathematics

File Description: application/xml; application/pdf

Access URL: http://arxiv.org/abs/2206.11832
https://zbmath.org/8037153
https://doi.org/10.46298/dmtcs.12540
https://doaj.org/article/8750a6fe844e48d9b4c5b8dca7a46e5b
https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.IPEC.2022.7
https://dspace.library.uu.nl/handle/1874/425596

Space-Efficient Algorithm for Integer Programming with Few Constraints

Authors: Rohwedder, Lars^Aff10, Węgrzycki, Karol^Aff11

Contributors: Goos, Gerhard, Series Editor^{Aff1, Aff3}, Hartmanis, Juris, Founding Editor^Aff2, Bertino, Elisa, Editorial Board Member^Aff4, Gao, Wen, Editorial Board Member^Aff5, Steffen, Bernhard, Editorial Board Member^Aff6, Yung, Moti, Editorial Board Member^Aff7, Megow, Nicole, editor^Aff8, Basu, Amitabh, editor^Aff9

Source: Integer Programming and Combinatorial Optimization : 26th International Conference, IPCO 2025, Baltimore, MD, USA, June 11–13, 2025, Proceedings. 15620:442-451

Parameterized Algorithms for Power Edge Set and Zero Forcing Set

Authors: Bhyravarapu, Sriram^Aff9, Kanesh, Lawqueen^Aff11, Kundu, Madhumita^Aff12, Lokshtanov, Daniel^Aff13, Saurabh, Saket^{Aff10, Aff12}

Contributors: Goos, Gerhard, Founding Editor^Aff1, Hartmanis, Juris, Founding Editor^Aff2, Bertino, Elisa, Series Editor^Aff3, Gao, Wen, Series Editor^Aff4, Steffen, Bernhard, Series Editor^Aff5, Yung, Moti, Series Editor^Aff6, Fernau, Henning, editor^Aff7, Zhu, Binhai, editor^Aff8

Source: Combinatorial Algorithms : 36th International Workshop, IWOCA 2025, Bozeman, MT, USA, July 21–24, 2025, Proceedings. 15885:349-361

A Fixed-Parameter Branching Algorithm for Chromatic Correlation Clustering

Authors: Oowa, Kensuke^Aff10, Fulla, Peter^Aff11, Fukunaga, Takuro^Aff11

Contributors: Goos, Gerhard, Series Editor^{Aff1, Aff3}, Hartmanis, Juris, Founding Editor^Aff2, Bertino, Elisa, Editorial Board Member^Aff4, Gao, Wen, Editorial Board Member^Aff5, Steffen, Bernhard, Editorial Board Member^Aff6, Yung, Moti, Editorial Board Member^Aff7, Finocchi, Irene, editor^Aff8, Georgiadis, Loukas, editor^Aff9

Source: Algorithms and Complexity : 14th International Conference, CIAC 2025, Rome, Italy, June 10–12, 2025, Proceedings, Part II. 15680:104-120

Reachability in Temporal Graphs Under Perturbation

Authors: Enright, Jessica^Aff9, Larios-Jones, Laura^Aff9, Meeks, Kitty^Aff9, Pettersson, William^Aff9

Contributors: Goos, Gerhard, Series Editor^Aff1, Hartmanis, Juris, Founding Editor^Aff2, Bertino, Elisa, Editorial Board Member^Aff3, Gao, Wen, Editorial Board Member^Aff4, Steffen, Bernhard, Editorial Board Member^Aff5, Yung, Moti, Editorial Board Member^Aff6, Královič, Rastislav, editor^Aff7, Kůrková, Věra, editor^Aff8

Source: SOFSEM 2025: Theory and Practice of Computer Science : 50th International Conference on Current Trends in Theory and Practice of Computer Science, SOFSEM 2025, Bratislava, Slovak Republic, January 20–23, 2025, Proceedings, Part I. 15538:255-269

Addressing Bias in Algorithmic Solutions: Exploring Vertex Cover and Feedback Vertex Set

Authors: Akhtar, Sheikh Shakil^Aff9, Madathil, Jayakrishnan^Aff10, Misra, Pranabendu^Aff9, Philip, Geevarghese^Aff9

Contributors: Goos, Gerhard, Series Editor^Aff1, Hartmanis, Juris, Founding Editor^Aff2, Bertino, Elisa, Editorial Board Member^Aff3, Gao, Wen, Editorial Board Member^Aff4, Steffen, Bernhard, Editorial Board Member^Aff5, Yung, Moti, Editorial Board Member^Aff6, Gaur, Daya, editor^Aff7, Mathew, Rogers, editor^Aff8

Source: Algorithms and Discrete Applied Mathematics : 11th International Conference, CALDAM 2025, Coimbatore, India, February 13–15, 2025, Proceedings. 15536:1-12

Crossing and Independent Families Among Polygons

Authors: Brötzner, Anna, Ganian, Robert, Hamm, Thekla, Klute, Fabian, Parada, Irene

Source: 19th International Symposium on Algorithms and Data Structures (WADS 2025) Leibniz International Proceedings in Informatics (LIPIcs).

Subject Terms: computational geometry, crossing families, crossing-free matchings, parameterized algorithms, segment intersection graphs

File Description: electronic

Access URL: https://urn.kb.se/resolve?urn=urn:nbn:se:mau:diva-80176
https://doi.org/10.4230/LIPIcs.WADS.2025.11

Exact and Approximate Pattern Counting in Degenerate Graphs: New Algorithms, Hardness Results, and Complexity Dichotomies

Authors: Bressan, Marco, Roth, Marc

Source: 2021 IEEE 62nd Annual Symposium on Foundations of Computer Science (FOCS) FOCS Foundations of Computer Science (FOCS), 2021 IEEE 62nd Annual Symposium on. :276-285 Feb, 2022

Relation: 2021 IEEE 62nd Annual Symposium on Foundations of Computer Science (FOCS)

Budget-feasible egalitarian allocation of conflicting jobs

Authors: Gupta, Sushmita^Aff1, Jain, Pallavi^Aff2, Mohanapriya, A.^Aff1, Tripathi, Vikash^{Aff1, IDs10458024096861_cor1}

Source: Autonomous Agents and Multi-Agent Systems. 39(1)

Max-SAT with cardinality constraint parameterized by the number of clauses

Authors: Jain, Pallavi ^a, Kanesh, Lawqueen ^b, Panolan, Fahad ^c, Saha, Souvik ^d, Sahu, Abhishek ^e, Saurabh, Saket ^{d, f}, Upasana, Anannya ^{⁎, d}

Source: In Theoretical Computer Science 21 November 2025 1056

Fine-Grained Classification Of Detecting Dominating Patterns

Authors: Dransfeld, Jonathan, Künnemann, Marvin, Redzic, Mirza

Contributors: Jonathan Dransfeld and Marvin Künnemann and Mirza Redzic

Subject Terms: FOS: Computer and information sciences, domination in graphs, Computational Complexity, parameterized algorithms, Data Structures and Algorithms, classification theorem, fine-grained complexity theory, Data Structures and Algorithms (cs.DS), subgraph isomorphism, ddc:004, Computational Complexity (cs.CC)

File Description: application/pdf

Access URL: http://arxiv.org/abs/2509.22332
https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ESA.2025.98

Linear Layouts Revisited: Stacks, Queues, and Exact Algorithms

Authors: Depian, Thomas, Fink, Simon D., Ganian, Robert, Surianarayanan, Vaishali

Contributors: Thomas Depian and Simon D. Fink and Robert Ganian and Vaishali Surianarayanan

Subject Terms: Computational Geometry (cs.CG), FOS: Computer and information sciences, parameterized algorithms, Data Structures and Algorithms, stack layouts, vertex integrity, Ramsey theory, Computational Geometry, Data Structures and Algorithms (cs.DS), ddc:004, queue layouts

File Description: application/pdf

Access URL: http://arxiv.org/abs/2508.16319
https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ESA.2025.15