## Stem hypergraph$ (all stems)

### 92 papers:

- STOC-2015-Louis #algorithm #approximate #markov
- Hypergraph Markov Operators, Eigenvalues and Approximation Algorithms (AL), pp. 713–722.
- LATA-2015-BaillyDR
- Recognizable Series on Hypergraphs (RB, FD, GR), pp. 639–651.
- ICML-2015-GhoshdastidarD #clustering
- A Provable Generalized Tensor Spectral Method for Uniform Hypergraph Partitioning (DG, AD), pp. 400–409.
- STOC-2014-GuruswamiHHSV
- Super-polylogarithmic hypergraph coloring hardness via low-degree long codes (VG, PH, JH, SS, GV), pp. 614–623.
- ICPR-2014-BaiHRE #complexity #graph
- Directed Depth-Based Complexity Traces of Hypergraphs from Directed Line Graphs (LB, ERH, PR, FE), pp. 3874–3879.
- ICPR-2014-BaiRH #kernel #morphism #testing
- A Hypergraph Kernel from Isomorphism Tests (LB, PR, ERH), pp. 3880–3885.
- ICPR-2014-GienTCL #fuzzy #learning #multi #predict
- Dual Fuzzy Hypergraph Regularized Multi-label Learning for Protein Subcellular Location Prediction (JG, YYT, CLPC, YL), pp. 512–516.
- KDD-2014-Yoshida #adaptation #algorithm #linear #sketching #using
- Almost linear-time algorithms for adaptive betweenness centrality using hypergraph sketches (YY), pp. 1416–1425.
- KEOD-2014-TarakciC #recommendation #using
- Using Hypergraph-based User Profile in a Recommendation System (HT, NKC), pp. 27–35.
- LICS-CSL-2014-GottlobM #bound #logic #problem
- Achieving new upper bounds for the hypergraph duality problem through logic (GG, EM), p. 10.
- SAT-2014-CapelliDM
- Hypergraph Acyclicity and Propositional Model Counting (FC, AD, SM), pp. 399–414.
- VLDB-2013-FenderM #top-down
- Counter Strike: Generic Top-Down Join Enumeration for Hypergraphs (PF, GM), pp. 1822–1833.
- STOC-2013-KeevashKM #polynomial
- Polynomial-time perfect matchings in dense hypergraphs (PK, FK, RM), pp. 311–320.
- GT-VMT-2013-MaximovaEE #analysis #graph transformation
- Analysis of Hypergraph Transformation Systems in AGG based on M-Functors (MM, HE, CE).
- ICEIS-v1-2013-IsmailHQDE #clustering #evaluation #query #simulation #using
- Clustering using Hypergraph for P2P Query Routing — Simulation and Evaluation (AI, MH, MQ, ND, MES), pp. 247–254.
- LICS-2013-Otto #finite #modelling #symmetry
- Groupoids, Hypergraphs, and Symmetries in Finite Models (MO), pp. 53–62.
- STOC-2012-GoemansORZ
- Matroids and integrality gaps for hypergraphic steiner tree relaxations (MXG, NO, TR, RZ), pp. 1161–1176.
- ICALP-v1-2012-SahaK #set
- Set Cover Revisited: Hypergraph Cover with Hard Capacities (BS, SK), pp. 762–773.
- ICPR-2012-SuDRH
- Hypergraph matching based on Marginalized Constrained Compatibility (JS, LD, PR, ERH), pp. 2922–2925.
- ICPR-2012-ZhangHR #classification #gender #learning
- Hypergraph based semi-supervised learning for gender classification (ZZ, ERH, PR), pp. 1747–1750.
- SIGIR-2012-BenderskyC #dependence #higher-order #information retrieval #modelling #query #using
- Modeling higher-order term dependencies in information retrieval using query hypergraphs (MB, WBC), pp. 941–950.
- GCM-2010-HeumullerJKS11 #category theory
- Construction of Pushout Complements in the Category of Hypergraphs (MH, SJ, BK, JS).
- STOC-2010-GaoW #random
- Load balancing and orientability thresholds for random hypergraphs (PG, NCW), pp. 97–104.
- STOC-2010-Marx #constraints #query
- Tractable hypergraph properties for constraint satisfaction and conjunctive queries (DM), pp. 735–744.
- ICALP-v1-2010-BansalK #problem #scheduling
- Inapproximability of Hypergraph Vertex Cover and Applications to Scheduling Problems (NB, SK), pp. 250–261.
- ICALP-v1-2010-FountoulakisP #multi #power of #random
- Orientability of Random Hypergraphs and the Power of Multiple Choices (NF, KP), pp. 348–359.
- ICALP-v1-2010-GuruswamiS #on the
- On the Inapproximability of Vertex Cover on k-Partite k-Uniform Hypergraphs (VG, RS), pp. 360–371.
- CIKM-2010-FangS #approximate #information retrieval #matrix #multi
- Hypergraph-based multilevel matrix approximation for text information retrieval (HrF, YS), pp. 1597–1600.
- LICS-2010-Otto
- Highly Acyclic Groups, Hypergraph Covers and the Guarded Fragment (MO), pp. 11–20.
- ICALP-v1-2009-AgnarssonHL #algorithm #independence #problem #set
- SDP-Based Algorithms for Maximum Independent Set Problems on Hypergraphs (GA, MMH, EL), pp. 12–23.
- ICALP-v2-2009-GottlobGS #optimisation #problem #strict
- Tractable Optimization Problems through Hypergraph-Based Structural Restrictions (GG, GG, FS), pp. 16–30.
- ICALP-v2-2009-KorulaP #algorithm #graph #problem
- Algorithms for Secretary Problems on Graphs and Hypergraphs (NK, MP), pp. 508–520.
- CIKM-2009-WangWLL #named #query #ranking #summary
- HyperSum: hypergraph based semi-supervised sentence ranking for query-oriented summarization (WW, FW, WL, SL), pp. 1855–1858.
- ICML-2009-KokD #learning #logic #markov #network
- Learning Markov logic network structure via hypergraph lifting (SK, PMD), pp. 505–512.
- KDD-2009-LinSCKSK #community #named #relational
- MetaFac: community discovery via relational hypergraph factorization (YRL, JS, PC, RBK, HS, AK), pp. 527–536.
- DATE-2008-LeinweberB #clustering #composition #fine-grained #reduction
- Fine-Grained Supply Gating Through Hypergraph Partitioning and Shannon Decomposition for Active Power Reduction (LL, SB), pp. 373–378.
- ICALP-A-2008-GrecoS #game studies
- Tree Projections: Hypergraph Games and Minimality (GG, FS), pp. 736–747.
- GT-VMT-2008-GrabskaSL #design #graph transformation #reasoning #visual notation
- Visual Design and Reasoning with the Use of Hypergraph Transformations (EG, GMS, TLL).
- ICGT-2008-MazanekMM #algorithm
- An Algorithm for Hypergraph Completion According to Hyperedge Replacement Grammars (SM, SM, MM), pp. 39–53.
- ICPR-2008-BuloATP #approach #estimation #parametricity
- A hypergraph-based approach to affine parameters estimation (SRB, AA, AT, MP), pp. 1–4.
- KDD-2008-SunJY #classification #learning #multi
- Hypergraph spectral learning for multi-label classification (LS, SJ, JY), pp. 668–676.
- SIGIR-2008-HuXZSL #clique #clustering #documentation #perspective
- Hypergraph partitioning for document clustering: a unified clique perspective (TH, HX, WZ, SYS, HL), pp. 871–872.
- LICS-2008-Duris #theorem
- Hypergraph Acyclicity and Extension Preservation Theorems (DD), pp. 418–427.
- STOC-2007-RodlS #testing
- Property testing in hypergraphs and the removal lemma (VR, MS), pp. 488–495.
- ICALP-2007-Bar-NoyCOS #online
- Online Conflict-Free Colorings for Hypergraphs (ABN, PC, SO, SS), pp. 219–230.
- CIKM-2007-BrinkmeierWR #community #graph
- Communities in graphs and hypergraphs (MB, JW, SR), pp. 869–872.
- ICML-2007-WachmanK #kernel #learning #order
- Learning from interpretations: a rooted kernel for ordered hypergraphs (GW, RK), pp. 943–950.
- SAC-2007-HebertBC #anti #constraints #optimisation
- Optimizing hypergraph transversal computation with an anti-monotone constraint (CH, AB, BC), pp. 443–444.
- DLT-2006-DediuKKN #approach #generative #graph grammar
- Contextual Hypergraph Grammars — A New Approach to the Generation of Hypergraph Languages (AHD, RKH, HJK, BN), pp. 327–338.
- ICGT-2006-RiedlSF #generative #graph grammar #order #strict #string #word
- String Generating Hypergraph Grammars with Word Order Restrictions (MR, SS, IF), pp. 138–152.
- ICML-2005-Tsuda
- Propagating distributions on a hypergraph by dual information regularization (KT), pp. 920–927.
- SAT-J-2004-GalesiK05 #polynomial #rank #satisfiability
- Polynomial Time SAT Decision, Hypergraph Transversals and the Hermitian Rank (NG, OK), pp. 89–104.
- FoSSaCS-2004-BucciarelliL #parallel
- Hypergraphs and Degrees of Parallelism: A Completeness Result (AB, BL), pp. 58–71.
- DLT-2004-Courcelle #bibliography #graph #relational #set
- Recognizable Sets of Graphs, Hypergraphs and Relational Structures: A Survey (BC), pp. 1–11.
- ICALP-2004-DengL
- A PTAS for Embedding Hypergraph in a Cycle (Extended Abstract) (XD, GL), pp. 433–444.
- ICGT-2004-SeifertF #generative #graph grammar #parsing #string
- Parsing String Generating Hypergraph Grammars (SS, IF), pp. 352–367.
- CIKM-2004-ChomickiMS #consistency #query #using
- Computing consistent query answers using conflict hypergraphs (JC, JM, SS), pp. 417–426.
- SAT-2004-GalesiK #polynomial #rank #satisfiability
- Polynomial Time SAT Decision, Hypergraph Transversals and the Hermitian Rank (NG, OK), pp. 76–85.
- STOC-2003-DinurGKR #multi
- A new multilayered PCP and the hardness of hypergraph vertex cover (ID, VG, SK, OR), pp. 595–601.
- AGTIVE-2003-Fischer #graph grammar #modelling
- Modeling Discontinuous Constituents with Hypergraph Grammars (IF), pp. 163–169.
- SAT-2003-Pretolani #problem #reduction #satisfiability
- Hypergraph Reductions and Satisfiability Problems (DP), pp. 383–397.
- STOC-2002-EiterGM #generative
- New results on monotone dualization and generating hypergraph transversals (TE, GG, KM), pp. 14–22.
- STOC-2002-Khot #approximate
- Hardness results for approximate hypergraph coloring (SK), pp. 351–359.
- ICALP-2002-Holmerin
- Improved Inapproximability Results for Vertex Cover on k -Uniform Hypergraphs (JH), pp. 1005–1016.
- ICALP-2002-KohayakawaNR #performance #testing
- Efficient Testing of Hypergraphs (YK, BN, VR), pp. 1017–1028.
- ICALP-2001-CzumajS #testing
- Testing Hypergraph Coloring (AC, CS), pp. 493–505.
- ICALP-2001-GottlobP #clique #model checking
- Hypergraphs in Model Checking: Acyclicity and Hypertree-Width versus Clique-Width (GG, RP), pp. 708–719.
- ICALP-2000-BorosGKM #generative #multi
- Generating Partial and Multiple Transversals of a Hypergraph (EB, VG, LK, KM), pp. 588–599.
- DAC-1999-CaldwellKKM #clustering #development #heuristic
- Hypergraph Partitioning for VLSI CAD: Methodology for Heuristic Development, Experimentation and Reporting (AEC, ABK, AAK, ILM), pp. 349–354.
- DAC-1999-CaldwellKM #clustering
- Hypergraph Partitioning with Fixed Vertices (AEC, ABK, ILM), pp. 355–359.
- DAC-1999-KarypisK #clustering #multi
- Multilevel k-way Hypergraph Partitioning (GK, VK), pp. 343–348.
- STOC-1999-Luks #equivalence #morphism
- Hypergraph Isomorphism and Structural Equivalence of Boolean Functions (EML), pp. 652–658.
- TAGT-1998-JacquetK #approach
- Node Replacement in Hypergraphs: Translating NCE Rewriting into the Pullback Approach (HJ, RKH), pp. 117–130.
- TAGT-1998-Minas #diagrams #representation
- Hypergraphs as a Uniform Diagram Representation Model (MM), pp. 281–295.
- DAC-1997-KarypisAKS #clustering #multi
- Multilevel Hypergraph Partitioning: Application in VLSI Domain (GK, RA, VK, SS), pp. 526–529.
- PODS-1997-GunopulosKMT #data mining #machine learning #mining
- Data mining, Hypergraph Transversals, and Machine Learning (DG, RK, HM, HT), pp. 209–216.
- KDD-1996-WangW #representation #using
- Representing Discovered Patterns Using Attributed Hypergraph (YW, AKCW), pp. 283–286.
- SIGMOD-1995-BhargavaGI #query
- Hypergraph Based Reorderings of Outer Join Queries with Complex Predicates (GB, PG, BRI), pp. 304–315.
- STOC-1995-FranklinY #privacy
- Secure hypergraphs: privacy from partial broadcast (Extended Abstract) (MKF, MY), pp. 36–44.
- DLT-1995-Hartmann #performance
- Efficient Subgraph Matching Within Cellular Hypergraphs (PH), pp. 309–318.
- DLT-1995-KimuraT #graph grammar
- Timed Attribute Hypergraph Grammars and Their Based Properties (YK, TT), pp. 319–328.
- DAC-1994-BuiM #algorithm #clustering #hybrid #performance #problem #search-based
- A Fast and Stable Hybrid Genetic Algorithm for the Ratio-Cut Partitioning Problem on Hypergraphs (TNB, BRM), pp. 664–669.
- TAGT-1994-KimJ #generative
- HRNCE Grammars — A Hypergraph Generating System with an eNCE Way (CK, TEJ), pp. 383–396.
- STOC-1992-Kelsen #complexity #independence #on the #parallel #set
- On the Parallel Complexity of Computing a Maximal Independent Set in a Hypergraph (PK), pp. 339–350.
- DAC-1991-RaithB
- A New Hypergraph Based Rip-Up and Reroute Strategy (MR, MB), pp. 54–59.
- GG-1990-CourcelleER #graph grammar
- Context-free Handle-rewriting Hypergraph Grammars (BC, JE, GR), pp. 253–268.
- GG-1990-EngelfrietH #generative #graph grammar #power of
- The Term Generating Power of Context-Free Hypergraph Grammars (JE, LH), pp. 328–243.
- SEKE-1990-YangH #modelling #using
- Modeling Software Objects Using Hypergraph (YY, FH), pp. 39–44.
- DAC-1989-Kahng #performance
- Fast Hypergraph Partition (ABK), pp. 762–766.
- PODS-1983-Sacca #database #on the #recognition
- On the Recognition of Coverings of Acyclic Database Hypergraphs (DS), pp. 297–304.
- PODS-1982-MaierU
- Connections in Acyclic Hypergraphs (DM, JDU), pp. 34–39.
- GG-1982-JanssensR #generative #graph
- Hypergraph systems generating graph languages (DJ, GR), pp. 172–185.