Authors: Goubault, Éric, Kniazev, Roman, Ledent, Jérémy
Subject Terms: Modal logics, epistemic logics, multi-agent systems, hypergraphs, Theory of computation → Modal and temporal logics
File Description: application/pdf
Relation: https://books.google.co.uk/books?id=WK4-DwAAQBAJ; https://dx.doi.org/10.4230/LIPIcs.CSL.2024; https://dx.doi.org/10.4230/LIPIcs.CSL.2015.211; https://dx.doi.org/10.1007/s11229-022-04032-y; https://dx.doi.org/10.1007/978-3-030-88853-4_3; https://dx.doi.org/10.1007/978-3-030-75267-5_1; https://dx.doi.org/10.1007/978-1-4020-5839-4; https://dx.doi.org/10.1109/LICS56636.2023.10175737; https://dx.doi.org/10.1016/j.ic.2020.104597; https://dx.doi.org/10.4230/LIPIcs.STACS.2022.33; https://dx.doi.org/10.1145/79147.79161; https://dx.doi.org/10.1016/0022-0000(89)90039-1; https://dx.doi.org/10.1007/BFb0015245; https://dx.doi.org/10.1016/S1571-0661(05)01148-5; https://dx.doi.org/10.48550/arXiv.2211.13543; https://dx.doi.org/10.1016/j.entcs.2009.07.102
Availability: https://doi.org/10.4230/lipics.csl.2024.3010.4230/LIPIcs.CSL.202410.4230/LIPIcs.CSL.2015.21110.1007/s11229-022-04032-y10.1007/978-3-030-88853-4_310.1007/978-3-030-75267-5_110.1007/978-1-4020-5839-410.1109/LICS56636.2023.1017573710.1016/j.ic.2020.10459710.4230/LIPIcs.STACS.2022.3310.1145/79147.7916110.1016/0022-0000(89)90039-110.1007/BFb001524510.1016/S1571-0661(05)01148-510.48550/arXiv.2211.1354310.1016/j.entcs.2009.07.102
Authors: Haviv, Ishay
Subject Terms: Kneser hypergraphs, consensus division, the complexity classes PPA-p, Theory of computation → Problems, reductions and completeness, Mathematics of computing → Graph theory
File Description: application/pdf
Subject Terms: Graph mining, Graph machine learning, hypergraph and network algorithms, high-performance computing for graphs, algorithm engineering for graphs, Theory of computation → Graph algorithms analysis, Computing methodologies → Machine learning algorithms, Computing methodologies → Parallel algorithms
File Description: application/pdf
Authors: Wahl, Noah, Gottesbüren, Lars
Subject Terms: hypergraph partitioning, local search algorithms, load balancing, local search, Mathematics of computing → Hypergraphs, Mathematics of computing → Graph algorithms
File Description: application/pdf
Relation: https://github.com/kahypar/mt-kahypar/tree/judicious_refinement; https://github.com/noahares/PhyloBenchmarkSet; http://www.satcompetition.org/2014/; https://dx.doi.org/10.4230/LIPIcs.SEA.2023; https://dx.doi.org/10.1145/274535.274546; https://dx.doi.org/10.1109/IPDPSW.2019.00038; https://dx.doi.org/10.1090/dimacs/043/02; https://dx.doi.org/10.1006/jcta.1996.2744; https://dx.doi.org/10.1006/eujc.1998.0266; https://dx.doi.org/10.1002/jgt.10174; https://dx.doi.org/10.1007/978-3-319-49487-6_4; https://dx.doi.org/10.1145/3571808; https://dx.doi.org/10.1109/71.780863; https://dx.doi.org/10.1145/2049662.2049663; https://dx.doi.org/10.1007/s101070100263; https://dx.doi.org/10.1145/800263.809204; https://dx.doi.org/10.4230/LIPIcs.SEA.2020.11; https://dx.doi.org/10.1137/1.9781611976472.2
Authors: Kirchweger, Markus, Peitl, Tomáš, Szeider, Stefan
Subject Terms: hypergraphs, graph coloring, SAT modulo symmetries, Theory of computation → Automated reasoning, Mathematics of computing → Hypergraphs, Mathematics of computing → Graph coloring, Mathematics of computing → Graph enumeration, Mathematics of computing → Matchings and factors
File Description: application/pdf
Relation: https://github.com/markirch/sat-modulo-symmetries/; https://sat-modulo-symmetries.readthedocs.io/; https://dx.doi.org/10.4230/LIPIcs.SAT.2023; https://dx.doi.org/10.1007/s10601-018-9294-5; https://dx.doi.org/10.4230/LIPIcs.SAT.2023.8; https://dx.doi.org/10.1145/3560469; https://dx.doi.org/10.1016/0304-3975(85)90144-6; https://dx.doi.org/10.4153/CJM-1981-046-9; https://dx.doi.org/10.48550/arXiv.2101.04698; https://dx.doi.org/10.4230/LIPIcs.SAT.2022.4; https://dx.doi.org/10.4230/LIPIcs.CP.2021.34; https://dx.doi.org/10.1016/j.jsc.2013.09.003; https://dx.doi.org/10.1142/S1793830914500396; https://dx.doi.org/10.1007/11564751_73; https://dx.doi.org/10.1007/978-3-319-09284-3_31
Availability: https://doi.org/10.4230/lipics.sat.2023.1310.4230/LIPIcs.SAT.202310.1007/s10601-018-9294-510.4230/LIPIcs.SAT.2023.810.1145/356046910.1016/0304-3975(85)90144-610.4153/CJM-1981-046-910.48550/arXiv.2101.0469810.4230/LIPIcs.SAT.2022.410.4230/LIPIcs.CP.2021.3410.1016/j.jsc.2013.09.00310.1142/S179383091450039610.1007/11564751_7310.1007/978-3-319-09284-3_31
Authors: Scheidt, Benjamin, Schweikardt, Nicole
Subject Terms: counting logics, guarded logics, homomorphism counting, hypertree decompositions, hypergraphs, incidence graphs, quantum graphs, Theory of computation → Finite Model Theory, Mathematics of computing → Hypergraphs
File Description: application/pdf
Relation: https://d-nb.info/979896851/34; https://dx.doi.org/10.4230/LIPIcs.MFCS.2023; https://dx.doi.org/10.1002/jgt.20025; https://dx.doi.org/10.1016/j.ejc.2007.04.013; https://dx.doi.org/10.1023/A:1004275029985; https://dx.doi.org/10.4230/LIPIcs.MFCS.2019.54; https://dx.doi.org/10.1007/BF01305232; https://dx.doi.org/10.4230/LIPIcs.ICALP.2018.40; https://dx.doi.org/10.2307/2586808; https://dx.doi.org/10.1145/3373718.3394739; https://dx.doi.org/10.1145/3375395.3387641; https://dx.doi.org/10.1109/FOCS46700.2020.00067; https://dx.doi.org/10.48550/arXiv.2303.10980
Authors: Dorobisz, Andrzej, Kozik, Jakub
Subject Terms: Local Computation Algorithms, Hypergraph Coloring, Property B, Mathematics of computing → Hypergraphs, Mathematics of computing → Probabilistic algorithms, Theory of computation → Streaming, sublinear and near linear time algorithms
File Description: application/pdf
Relation: https://dx.doi.org/10.4230/LIPIcs.ICALP.2023; https://dx.doi.org/10.1145/3350755.3400250; https://dx.doi.org/10.1002/rsa.3240020403; https://dx.doi.org/10.1137/1.9781611973099.89; https://dx.doi.org/10.1002/0471722154; https://dx.doi.org/10.1002/rsa.3240020402; https://dx.doi.org/10.1137/17M1157957; https://dx.doi.org/10.1016/j.ic.2018.07.001; https://dx.doi.org/10.3390/a14120355; https://dx.doi.org/10.4230/LIPIcs.DISC.2017.18; https://dx.doi.org/10.1109/FOCS.2018.00069; https://dx.doi.org/10.1109/SFCS.1987.20; https://dx.doi.org/10.1007/978-3-642-31594-7_55; https://dx.doi.org/10.1007/978-3-642-04016-0; https://dx.doi.org/10.1145/276698.276866
Authors: Suk, Andrew, Zeng, Ji
Subject Terms: independent sets, hypergraph container method, generalised Sidon sets, Mathematics of computing → Combinatorics
File Description: application/pdf
Relation: www.tu-chemnitz.de/informatik/ThIS/downloads/publications/lefmann_no_three_submitted.pdf; https://dx.doi.org/10.4230/LIPIcs.SoCG.2023
Authors: Abrahamsen, Mikkel, Kleist, Linda, Miltzow, Tillmann
Subject Terms: simplicial complex, geometric embedding, linear embedding, hypergraph, recognition, existential theory of the reals, Theory of computation → Computational geometry
File Description: application/pdf
Relation: https://proceedings.neurips.cc/paper/2021/file/9813b270ed0288e7c0388f0fd4ec68f5-Paper.pdf; http://kssarkaria.org/docs/Linear%20vs.%20piecewise-linear%20embeddability%20of%20simplicial%20complexes.pdf; https://dx.doi.org/10.4230/LIPIcs.SoCG.2023; https://dx.doi.org/10.4230/LIPIcs.SoCG.2016.3; https://dx.doi.org/10.1109/FOCS52979.2021.00045; https://dx.doi.org/10.1145/3188745.3188868; https://dx.doi.org/10.1109/FOCS46700.2020.00098; https://dx.doi.org/10.1016/j.disc.2004.07.035; https://dx.doi.org/10.4230/LIPIcs.STACS.2016.17; https://dx.doi.org/10.2307/1970092; https://dx.doi.org/10.1007/s004540010027; https://dx.doi.org/10.1090/S0002-9939-1983-0715878-1; https://dx.doi.org/10.1090/S0002-9947-1972-0307245-7; https://dx.doi.org/10.1145/2597629; https://dx.doi.org/10.1007/s00454-013-9551-8; https://dx.doi.org/10.1137/120899029; https://dx.doi.org/10.1007/s00454-016-9855-6
Authors: Eyubov, Kamal, Fonseca Faraj, Marcelo, Schulz, Christian
Subject Terms: Hypergraph partitioning, graph partitioning, edge partitioning, streaming, Theory of computation → Streaming, sublinear and near linear time algorithms, Theory of computation → Graph algorithms analysis
File Description: application/pdf
Relation: http://www.satcompetition.org/2014/; https://dx.doi.org/10.4230/LIPIcs.SEA.2023; https://dx.doi.org/10.14778/3236187.3236208; https://dx.doi.org/10.1007/978-3-319-96983-1_47; https://dx.doi.org/10.5555/2969442.2969452; https://dx.doi.org/10.1145/274535.274546; https://dx.doi.org/10.1145/3394486.3403239; https://dx.doi.org/10.1109/TKDE.2007.190689; https://dx.doi.org/10.1016/0020-0190(92)90140-Q; https://dx.doi.org/10.1007/978-3-319-49487-6_4; https://dx.doi.org/10.1007/978-0-387-09766-4_93; https://dx.doi.org/doi.org/10.1145/3571808; https://dx.doi.org/10.1145/2049662.2049663; https://dx.doi.org/10.1145/3546911; https://dx.doi.org/10.1109/CLUSTER51413.2022.00057; https://dx.doi.org/10.4230/LIPIcs.SEA.2020.4; https://dx.doi.org/10.1145/800119.803884
Availability: https://doi.org/10.4230/lipics.sea.2023.1510.4230/LIPIcs.SEA.202310.14778/3236187.323620810.1007/978-3-319-96983-1_4710.5555/2969442.296945210.1145/274535.27454610.1145/3394486.340323910.1109/TKDE.2007.19068910.1016/0020-0190(92)90140-Q10.1007/978-3-319-49487-6_410.1007/978-0-387-09766-4_93doi.org/10.1145/357180810.1145/2049662.204966310.1145/354691110.1109/CLUSTER51413.2022.0005710.4230/LIPIcs.SEA.2020.410.1145/800119.803884
Authors: Tsai, Meng-Tsung, Tsai, Shi-Chun, Wu, Tsung-Ta
Subject Terms: Hereditary Systems, Hypergraph Matchings, Compleixty Trichotomy, Mathematics of computing → Matroids and greedoids
File Description: application/pdf
Authors: Dufoulon, Fabien, Emek, Yuval, Gelles, Ran
Subject Terms: Beeping Networks, Shortest Paths, Hypergraph Bipartite Decomposition, Theory of computation → Distributed algorithms
File Description: application/pdf
Relation: https://dx.doi.org/10.4230/LIPIcs.ITCS.2023; https://dx.doi.org/10.1007/s00446-012-0175-7; https://dx.doi.org/10.1126/science.1193210; https://dx.doi.org/10.1016/0012-365X(90)90136-6; https://dx.doi.org/10.1016/0022-0000(91)90015-W; https://dx.doi.org/10.1145/3382734.3405705; https://dx.doi.org/10.1007/BF02259748; https://dx.doi.org/10.1109/INFOCOM.2018.8486015; https://dx.doi.org/10.1007/978-3-030-24922-9_5; https://dx.doi.org/10.1016/j.ic.2018.10.001; https://dx.doi.org/10.3233/FI-2017-1537; https://dx.doi.org/10.1007/978-3-642-15763-9_15; https://dx.doi.org/10.1016/j.jpdc.2019.03.020; https://dx.doi.org/10.4230/LIPIcs.DISC.2018.20; https://dx.doi.org/10.1145/3382734.3405699; https://dx.doi.org/10.1007/978-3-662-45174-8_15; https://dx.doi.org/10.1137/1.9781611973105.54; https://dx.doi.org/10.1007/978-3-662-53426-7
Availability: https://doi.org/10.4230/lipics.itcs.2023.4510.4230/LIPIcs.ITCS.202310.1007/s00446-012-0175-710.1126/science.119321010.1016/0012-365X(90)90136-610.1016/0022-0000(91)90015-W10.1145/3382734.340570510.1007/BF0225974810.1109/INFOCOM.2018.848601510.1007/978-3-030-24922-9_510.1016/j.ic.2018.10.00110.3233/FI-2017-153710.1007/978-3-642-15763-9_1510.1016/j.jpdc.2019.03.02010.4230/LIPIcs.DISC.2018.2010.1145/3382734.340569910.1007/978-3-662-45174-8_1510.1137/1.9781611973105.5410.1007/978-3-662-53426-7
Authors: Oko, Kazusato, Sakaue, Shinsaku, Tanigawa, Shin-ichi
Subject Terms: Spectral sparsification, Directed hypergraphs, Iterative sampling, Theory of computation → Sparsification and spanners
File Description: application/pdf
Relation: http://cs-www.cs.yale.edu/homes/spielman/sagt/sagt.pdf; https://dx.doi.org/10.4230/LIPIcs.ICALP.2023; https://dx.doi.org/10.1561/0400000051; https://dx.doi.org/10.1561/0400000054
Authors: Efthymiou, Charilaos, Feng, Weiming
Subject Terms: spin-system, spin-glass, sparse random hypergraph, approximate sampling, efficient algorithm, Theory of computation → Design and analysis of algorithms, Theory of computation → Randomness, geometry and discrete structures, Mathematics of computing → Discrete mathematics
File Description: application/pdf
Authors: Alvarez-Picallo, Mario, Ghica, Dan, Sprunger, David, Zanasi, Fabio
Subject Terms: string diagrams, automatic differentiation, hierarchical hypergraphs, Mathematics of computing → Automatic differentiation, Theory of computation → Categorical semantics
File Description: application/pdf
Relation: http://jmlr.org/papers/v18/17-468.html; http://www.cs.ox.ac.uk/files/4551/cqm-notes.pdf; https://dx.doi.org/10.4230/LIPIcs.CSL.2023; https://dx.doi.org/10.1007/978-3-642-12821-9_2; https://dx.doi.org/10.1145/2933575.2935316; https://dx.doi.org/10.1016/j.jlamp.2017.12.002; https://dx.doi.org/10.1145/3371132; https://dx.doi.org/10.1145/1190216.1190269; https://dx.doi.org/10.1016/0304-3975(87)90045-4; https://dx.doi.org/10.1016/S0304-3975(99)00050-X; https://dx.doi.org/10.1007/978-3-030-45231-5_17; https://dx.doi.org/10.1145/96709.96711; https://dx.doi.org/10.1016/S0304-3975(00)00198-5; https://dx.doi.org/10.1007/11874683_1; https://dx.doi.org/10.23638/LMCS-15(4:7)2019
Availability: https://doi.org/10.4230/lipics.csl.2023.610.4230/LIPIcs.CSL.202310.1007/978-3-642-12821-9_210.1145/2933575.293531610.1016/j.jlamp.2017.12.00210.1145/337113210.1145/1190216.119026910.1016/0304-3975(87)90045-410.1016/S0304-3975(99)00050-X10.1007/978-3-030-45231-5_1710.1145/96709.9671110.1016/S0304-3975(00)00198-510.1007/11874683_110.23638/LMCS-15(4:7)2019
Authors: d'Orsi, Tommaso, Trevisan, Luca
Subject Terms: CSP, k-XOR, strong refutation, sum-of-squares, tensor, graph, hypergraph, non-backtracking walk, Theory of computation, Mathematics of computing → Probability and statistics
File Description: application/pdf
Relation: https://dx.doi.org/10.4230/LIPIcs.CCC.2023; https://dx.doi.org/10.1109/FOCS.2015.48; https://dx.doi.org/10.1109/FOCS.2015.86
Authors: Li, Mahei Manhai
Subject Terms: value proposition graph, service model, service structure, service, service theory, service system, general systems theory, systems perspective, value structure, service graph, value graph, Dienstleistung, Wertschöpfung, Netzwerk, Modelltheorie, Systemtheorie, Hypergraph
Time: 004, 330, 340, 600
Authors: Stein, Dario, Samuelson, Richard
Subject Terms: systems theory, hypergraph categories, Bayesian inference, category theory, Markov categories, Theory of computation → Probabilistic computation, Theory of computation → Categorical semantics, Mathematics of computing → Probability and statistics
File Description: application/pdf
Relation: http://probmods.org; https://dx.doi.org/10.4230/LIPIcs.CALCO.2023; https://dx.doi.org/10.1016/0022-4049(87)90121-6; https://dx.doi.org/10.32408/compositionality-2-3; https://dx.doi.org/10.1145/3373718.3394795; https://dx.doi.org/10.1016/B978-0-12-426653-7.50016-8; https://dx.doi.org/10.1023/A:1008935617754; https://dx.doi.org/10.1017/etds.2023.6; https://dx.doi.org/10.1016/j.scico.2022.102791
Availability: https://doi.org/10.4230/lipics.calco.2023.1310.4230/LIPIcs.CALCO.202310.1016/0022-4049(87)90121-610.32408/compositionality-2-310.1145/3373718.339479510.1016/B978-0-12-426653-7.50016-810.1023/A:100893561775410.1017/etds.2023.610.1016/j.scico.2022.102791
Authors: Damásdi, Gábor, Pálvölgyi, Dömötör
Subject Terms: Discrete geometry, Geometric hypergraph coloring, Decomposition of multiple coverings, Mathematics of computing → Hypergraphs
File Description: application/pdf
Relation: https://dx.doi.org/10.4230/LIPIcs.SoCG.2022; https://dx.doi.org/10.1137/19M1290231; https://dx.doi.org/10.1007/s00454-017-9902-y; https://dx.doi.org/10.1007/s00454-009-9238-3; https://dx.doi.org/10.1007/978-3-642-40104-6_7; https://dx.doi.org/10.1007/978-3-319-78434-2_1; https://dx.doi.org/10.1016/j.jctb.2018.11.005; https://dx.doi.org/10.20382/jocg.v4i1a10; https://dx.doi.org/10.1137/140955975; https://dx.doi.org/10.1002/rsa.20246; https://dx.doi.org/10.1007/s00454-011-9353-9; https://dx.doi.org/10.1016/j.comgeo.2011.09.004; https://dx.doi.org/10.1007/s00454-011-9377-1; https://dx.doi.org/10.1007/s00454-014-9582-9; https://dx.doi.org/10.20382/jocg.v10i1a1; https://dx.doi.org/10.1007/s00454-019-00096-9; https://dx.doi.org/10.1007/s00454-015-9687-9
Authors: Gottesbüren, Lars, Heuer, Tobias, Sanders, Peter
Subject Terms: multilevel hypergraph partitioning, shared-memory algorithms, maximum flow, Mathematics of computing → Hypergraphs, Mathematics of computing → Graph algorithms
File Description: application/pdf
Relation: https://github.com/kahypar/mt-kahypar; https://github.com/larsgottesbueren/WHFC/tree/parallel; https://algo2.iti.kit.edu/heuer/sea22/; http://www.satcompetition.org/2014/; https://dx.doi.org/10.4230/LIPIcs.SEA.2022; https://dx.doi.org/10.1137/1.9781611974768.3; https://dx.doi.org/10.1007/978-3-319-96983-1_47; https://dx.doi.org/10.1145/274535.274546; https://dx.doi.org/10.1016/0167-9260(95)00008-4; https://dx.doi.org/10.5555/1347082.1347154; https://dx.doi.org/10.1006/jpdc.1995.1103; https://dx.doi.org/10.14778/3311880.3311887; https://dx.doi.org/10.1016/j.jpdc.2007.09.006; https://dx.doi.org/10.1090/conm/588; https://dx.doi.org/10.1007/978-3-662-48350-3_10; https://dx.doi.org/10.1109/71.780863; https://dx.doi.org/10.1007/PL00009180
Availability: https://doi.org/10.4230/lipics.sea.2022.510.4230/LIPIcs.SEA.202210.1137/1.9781611974768.310.1007/978-3-319-96983-1_4710.1145/274535.27454610.1016/0167-9260(95)00008-410.5555/1347082.134715410.1006/jpdc.1995.110310.14778/3311880.331188710.1016/j.jpdc.2007.09.00610.1090/conm/58810.1007/978-3-662-48350-3_1010.1109/71.78086310.1007/PL00009180