An Improved Quality Hierarchical Congestion Approximator in Near-Linear Time

Authors: Henzinger, Monika, Münk, Robin, Räcke, Harald

Source: Proceedings of the 58th Annual ACM Symposium on Theory of Computing. :1417-1428

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

Faster Chaitin-like Register Allocation via Grammatical Decompositions of Control-Flow Graphs

Authors: Cai, Xuran, Goharshady, Amir Kafshdar, Hitarth, S., Lam, Chun Kit

Source: Proceedings of the 30th ACM International Conference on Architectural Support for Programming Languages and Operating Systems, Volume 1. :463-477

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

Equitable

Authors: Baumann, Stacie^{Aff2, Aff3}, Rodger, Chris^Aff4

Contributors: Bahmanian, Amin, editor^Aff1

Source: Combinatorics and Combinatorial Computing : MCCCC34, Normal, IL, USA, October 21–23, 2022. 516:47-67

Efficient Algorithms for Partial Constraint Satisfaction Problems over Control-Flow Graphs

Authors: Cai, Xuran^Aff9, Goharshady, Amir Kafshdar^Aff9

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, Goharshady, Amir, editor^Aff7, Haase, Christoph, editor^Aff8

Source: Dependable Software Engineering. Theories, Tools, and Applications : 11th International Symposium on Dependable Software Engineering: Theories, Tools, and Applications, SETTA 2025, Oxford, UK, December 1–3, 2025, Proceedings. 16458:277-295

Series–parallel-loop decompositions of control-flow graphs

Authors: Cai, Xuran ^{a, ⁎}, Goharshady, Amir Kafshdar ^a, Hitarth, S. ^b, Lam, Chun Kit ^b

Source: In Journal of Systems Architecture May 2026 174

On cyclic P(4n,2n − 1)-designs

Authors: Wannasit, Wannasiri

Source: In Discrete Mathematics May 2026 349(5)

The Role of Counting Quantifiers in Laminar Set Systems

Authors: Campbell, Rutger, Köhler, Noleen

Contributors: Rutger Campbell and Noleen Köhler

Subject Terms: MSO-transductions, simulating counting quantifiers, laminar set systems, graph decompositions

File Description: application/pdf

Relation: Is Part Of LIPIcs, Volume 374, 53rd International Colloquium on Automata, Languages, and Programming (ICALP 2026); https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ICALP.2026.174

Availability: https://doi.org/10.4230/LIPIcs.ICALP.2026.174
https://nbn-resolving.org/urn:nbn:de:0030-drops-265625
https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ICALP.2026.174

The Complexity of Decomposing a Graph into a Matching and a Bounded Linear Forest: The complexity of decomposing a graph into a matching and a bounded linear forest

Authors: Agnijo Banerjee, João Pedro Marciano, Adva Mond, Jan Petr, Julien Portier

Source: Journal of Graph Theory. 109:76-87

Subject Terms: FOS: Computer and information sciences, Computer Science - Computational Complexity, computational complexity, 68Q15, 68Q17, 68R10, 68R05, 05C70, graph decompositions, Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.), FOS: Mathematics, Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.), Mathematics - Combinatorics, linear forests, Combinatorics (math.CO), Computational Complexity (cs.CC), NP-completeness

File Description: application/xml

Access URL: http://arxiv.org/abs/2304.03256
https://zbmath.org/8035807
https://doi.org/10.1002/jgt.23208

A Comprehensive Review of Graph Theory Applications in Secret Sharing Schemes: A comprehensive review of graph theory applications in secret sharing schemes

Authors: Akdim, Mohamed, Drissi, Ahmed

Source: Journal of Combinatorial Mathematics and Combinatorial Computing. 123:61-73

Subject Terms: graph decompositions, Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.), Graph theory (including graph drawing) in computer science, Applications of graph theory, bipartite graph, Cryptography, secret sharing, graph access structure, Authentication, digital signatures and secret sharing

File Description: application/xml

Access URL: https://zbmath.org/7988362
https://doi.org/10.61091/jcmcc123-05

Cyclic Decompositions of λ K n into LWO Graphs: Cyclic decompositions of \(\lambda K_n\) into LWO graphs

Authors: Hein, Derek W.

Source: Journal of Combinatorial Mathematics and Combinatorial Computing. 122:3-11

Subject Terms: Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.), cyclic graph decompositions, LWO graph

File Description: application/xml

Faster Lifetime-Optimal Speculative Partial Redundancy Elimination for Goto-Free Programs

Authors: Cai, Xuran^Aff10, Goharshady, Amir^Aff10

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, Bourke, Timothy, editor^Aff7, Chen, Liqian, editor^Aff8, Goharshady, Amir, editor^Aff9

Source: Dependable Software Engineering. Theories, Tools, and Applications : 10th International Symposium, SETTA 2024, Hong Kong, China, November 26–28, 2024, Proceedings. 15469:382-398

Embedding partial 3-star designs

Authors: Matt Noble, Shayne Nochumson

Source: Electronic Journal of Graph Theory and Applications, Vol 12, Iss 2, Pp 289-295 (2024)

Subject Terms: graph decompositions, embedding partial graph decompositions, stars, Mathematics, QA1-939

File Description: electronic resource

Relation: http://www.ejgta.org/index.php/ejgta/article/view/743; https://doaj.org/toc/2338-2287

Access URL: https://doaj.org/article/ac009c82e29247098cff60aec6de39c8

Decentralized Low-Stretch Trees via Low Diameter Graph Decompositions: Decentralized low-stretch trees via low diameter graph decompositions

Authors: Ruben Becker, Yuval Emek, Mohsen Ghaffari 0001, Christoph Lenzen 0001

Source: SIAM Journal on Computing. 53:247-286

Subject Terms: distributed graph algorithms, parallel graph algorithms, (semi-)streaming graph algorithms, metric tree embeddings, low-stretch trees, graph decompositions, Graph theory (including graph drawing) in computer science, Randomized algorithms, Distributed algorithms, Online algorithms, streaming algorithms, Parallel algorithms in computer science, Metric embeddings as related to computational problems and algorithms

File Description: application/xml

An improved quality hierarchical congestion approximator in near-linear time

Authors: Henzinger, Monika H, Münk, Robin, Räcke, Harald

Source: Henzinger M, Münk R, Räcke H. An improved quality hierarchical congestion approximator in near-linear time. In: 58th Annual ACM Symposium on Theory of Computing . ACM; 2026:1417-1428. doi: 10.1145/3798129.3800851

Subject Terms: Congestion Approximators, Hierarchical Graph Decompositions, ddc:000

Relation: info:eu-repo/semantics/altIdentifier/issn/0737-8017; info:eu-repo/semantics/altIdentifier/isbn/9798400725364; info:eu-repo/semantics/altIdentifier/arxiv/2511.03716

Availability: https://research-explorer.ista.ac.at/record/22245
https://research-explorer.ista.ac.at/download/22245/22250

Local certification of graph decompositions and applications to minor-free classes

Authors: Bousquet, Nicolas ^a, Feuilloley, Laurent ^{a, ⁎}, Pierron, Théo ^b

Source: In Journal of Parallel and Distributed Computing November 2024 193

Additive graph decompositions

Authors: Nakić, Anamari

Subject Terms: additive graph decompositions

Decomposing the -Fold Complete 3-Uniform Hypergraph into the Lines of the Pasch Configuration

Authors: Bunge, Ryan C.^Aff5, Dodson, Skyler R.^Aff5, El-Zanati, Saad I.^Aff5, Franzmeier, Jacob^Aff6, Horne, Dru^Aff7

Contributors: Heuss, Sarah, editor^Aff1, Low, Richard, editor^Aff2, Wierman, John C., editor^Aff3, Hoffman, Frederick, Editor-in-Chief^Aff4

Source: Combinatorics, Graph Theory and Computing : SEICCGTC 2022, Boca Raton, USA, March 7–11. 462:307-317

Sum-of-Local-Effects Data Structures for Separable Graphs

Authors: Lyu, Xing^Aff9, Gagie, Travis^Aff10, He, Meng^Aff10, Nekrich, Yakov^Aff11, Zeh, Norbert^Aff10

Contributors: Goos, Gerhard, Founding 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, Wu, Weili, editor^Aff7, Tong, Guangmo, editor^Aff8

Source: Computing and Combinatorics : 29th International Conference, COCOON 2023, Hawaii, HI, USA, December 15–17, 2023, Proceedings, Part I. 14422:195-206

Characterising graphs with no subdivision of a wheel of bounded diameter

Authors: Johannes Carmesin

Source: Journal of Combinatorial Theory, Series B. 161:21-51

Subject Terms: shallow minors, local separators, 0211 other engineering and technologies, Graph minors, characterisation of graph classes, 02 engineering and technology, 0102 computer and information sciences, 01 natural sciences, graph minor, graph decompositions, 05C40, 05C75, 05C83, Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.), FOS: Mathematics, Mathematics - Combinatorics, Structural characterization of families of graphs, Combinatorics (math.CO), 0101 mathematics, duality theorem

File Description: application/xml

Access URL: http://arxiv.org/abs/2008.03031

A Linear Fixed Parameter Tractable Algorithm for Connected Pathwidth: A linear fixed parameter tractable algorithm for connected pathwidth

Authors: Kanté, Mamadou Moustapha, Paul, Christophe, Thilikos, Dimitrios M.

Contributors: Mamadou Moustapha Kanté and Christophe Paul and Dimitrios M. Thilikos, Thilikos, Dimitrios, Fabrizio Grandoni, Grzegorz Herman, Peter Sanders

Source: SIAM Journal on Discrete Mathematics. 36:411-435

Subject Terms: FOS: Computer and information sciences, parameterized algorithms, [INFO.INFO-DS] Computer Science [cs]/Data Structures and Algorithms [cs.DS], Pathwidth, G.2.2, 0102 computer and information sciences, 01 natural sciences, Typical sequences, width parameter, Graph theory, [MATH.MATH-CO] Mathematics [math]/Combinatorics [math.CO], [INFO.INFO-DM] Computer Science [cs]/Discrete Mathematics [cs.DM], Parameterized algorithms, Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.), Graph algorithms (graph-theoretic aspects), Computer Science - Data Structures and Algorithms, Cops and Robber games, Data Structures and Algorithms (cs.DS), 05C85, graph decomposition, Width parameter, Graph decompositions, cops and robber game, Graph searching

File Description: application/xml; application/pdf

Access URL: https://drops.dagstuhl.de/opus/volltexte/2020/12930/pdf/LIPIcs-ESA-2020-64.pdf
http://arxiv.org/abs/2004.11937
https://zbmath.org/7489476
https://doi.org/10.1137/20m1369361
https://arxiv.org/abs/2004.11937
https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ESA.2020.64
https://hal.science/hal-03002761v1
https://hal.science/hal-03002761v1/document
https://doi.org/10.4230/lipics.esa.2020.64