## Stem minor$ (all stems)

### 44 papers:

- ICALP-v1-2015-GiannopoulouJLS #complexity #kernel
- Uniform Kernelization Complexity of Hitting Forbidden Minors (ACG, BMPJ, DL, SS), pp. 629–641.
- ICALP-v2-2015-KawarabayashiK #graph #theorem #towards
- Towards the Graph Minor Theorems for Directed Graphs (KiK, SK), pp. 3–10.
- STOC-2014-AbrahamGGNT #composition #graph
- Cops, robbers, and threatening skeletons: padded decomposition for minor-free graphs (IA, CG, AG, ON, KT), pp. 79–88.
- STOC-2014-ChekuriC #bound #polynomial #theorem
- Polynomial bounds for the grid-minor theorem (CC, JC), pp. 60–69.
- ICALP-v1-2014-Wulff-Nilsen #approximate #distance #graph #performance
- Faster Separators for Shallow Minor-Free Graphs via Dynamic Approximate Distance Oracles (CWN), pp. 1063–1074.
- SEKE-2014-FinlayPC #predict
- Synthetic Minority Over-sampling TEchnique (SMOTE) for Predicting Software Build Outcomes (JF, RP, AMC), pp. 546–551.
- CSEET-2013-DebGG #case study #experience #re-engineering #social
- Software engineering projects with social significance: An experience report at a minority university (DD, LG, MG), pp. 314–318.
- ITiCSE-WGR-2013-ShumbaFSTFTSABH #recommendation #women
- Cybersecurity, women and minorities: findings and recommendations from a preliminary investigation (RS, KFB, ES, CT, GF, CT, CS, GA, RB, LH), pp. 1–14.
- ICALP-v1-2013-LeviR #graph
- A Quasi-Polynomial Time Partition Oracle for Graphs with an Excluded Minor (RL, DR), pp. 709–720.
- LICS-2013-EickmeyerKK #first-order #graph #invariant #logic #model checking
- Model Checking for Successor-Invariant First-Order Logic on Minor-Closed Graph Classes (KE, KiK, SK), pp. 134–142.
- DATE-2012-ZhangWHY #algorithm #energy #game studies #resource management
- Fair energy resource allocation by minority game algorithm for smart buildings (CZ, WW, HH, HY), pp. 63–68.
- ICALP-v1-2012-ChekuriEV #design #graph #network #product line
- Node-Weighted Network Design in Planar and Minor-Closed Families of Graphs (CC, AE, AV), pp. 206–217.
- ICALP-v1-2012-KrauthgamerZ #using
- Preserving Terminal Distances Using Minors (RK, TZ), pp. 594–605.
- CHI-2012-LeivaA #automation #exclamation
- Monsieur, azonnal kövessen engem bitte!: an automatically generated interlanguage tailored to speakers of minority but culturally influenced languages (LAL, VA), pp. 31–34.
- DATE-2011-ShafiqueBAH #configuration management #manycore #resource management #runtime
- Minority-Game-based resource allocation for run-time reconfigurable multi-core processors (MS, LB, WA, JH), pp. 1261–1266.
- STOC-2011-DemaineHK #algorithm #composition #graph
- Contraction decomposition in h-minor-free graphs and algorithmic applications (EDD, MH, KiK), pp. 441–450.
- STOC-2011-KawarabayashiW #algorithm #composition #graph #proving
- A simpler algorithm and shorter proof for the graph minor decomposition (KiK, PW), pp. 451–458.
- ICALP-v1-2011-KawarabayashiKS #approximate #bound #distance #graph
- Linear-Space Approximate Distance Oracles for Planar, Bounded-Genus and Minor-Free Graphs (KiK, PNK, CS), pp. 135–146.
- DHM-2011-ZhangWRFHLN
- Human Dimensions of Chinese Minors (XZ, YW, LR, AF, KH, TL, JN), pp. 37–45.
- DHM-2011-ZhangWRFHLN11a #development
- Development of Sizing Systems for Chinese Minors (XZ, YW, LR, AF, KH, TL, JN), pp. 46–55.
- ITiCSE-2010-McGill #collaboration #design #education #framework #game studies
- Collaborative design of cross-disciplinary game minors based on the IGDA curriculum framework (MM), pp. 259–263.
- STOC-2010-KawarabayashiW #algorithm #graph #proving #theorem
- A shorter proof of the graph minor algorithm: the unique linkage theorem (KiK, PW), pp. 687–694.
- LICS-2010-Grohe #fixpoint #graph #polynomial
- Fixed-Point Definability and Polynomial Time on Graphs with Excluded Minors (MG), pp. 179–188.
- STOC-2009-LeeS #geometry #graph #on the
- On the geometry of graphs with a forbidden minor (JRL, AS), pp. 245–254.
- ICALP-v1-2009-DemaineHK #algorithm #approximate #graph
- Approximation Algorithms via Structural Results for Apex-Minor-Free Graphs (EDD, MH, KiK), pp. 316–327.
- STOC-2008-BenjaminiSS #graph
- Every minor-closed property of sparse graphs is testable (IB, OS, AS), pp. 393–402.
- CAV-2008-JoshiK #graph transformation #theorem #verification
- Applying the Graph Minor Theorem to the Verification of Graph Transformation Systems (SJ, BK), pp. 214–226.
- ITiCSE-2007-AustinJF #student
- Stimulating minority student retention with BalloonSAT projects (SAA, LPJ, JMF), p. 320.
- LICS-2007-DawarGK
- Locally Excluding a Minor (AD, MG, SK), pp. 270–279.
- STOC-2006-KawarabayashiM #approximate #graph
- Approximating the list-chromatic number and the chromatic number in minor-closed and odd-minor-closed classes of graphs (KiK, BM), pp. 401–416.
- LICS-2005-Dalmau
- Generalized Majority-Minority Operations are Tractable (VD), pp. 438–447.
- CHI-2002-MullerC #community #design #requirements #towards
- Design as a minority discipline in a software company: toward requirements for a community of practice (MJM, KC), pp. 383–390.
- CIKM-2001-GhaniJM #corpus #mining #web
- Mining the Web to Create Minority Language Corpora (RG, RJ, DM), pp. 279–286.
- SIGIR-2001-GhaniJM #automation #corpus #generative #query #web
- Automatic Web Search Query Generation to Create Minority Language Corpora (RG, RJ, DM), pp. 432–433.
- ICALP-2000-Grigni #approximate #graph
- Approximate TSP in Graphs with Forbidden Minors (MG), pp. 869–877.
- FoSSaCS-1998-BottreauM #graph #normalisation
- Minor Searching, Normal Forms of Graph Relabelling: Two Applications Based on Enumerations by Graph Relabelling (AB, YM), pp. 110–124.
- CSL-1998-KreidlerS #graph #monad
- Monadic NP and Graph Minors (MK, DS), pp. 126–141.
- ICML-1997-CardieN #predict #using
- Improving Minority Class Prediction Using Case-Specific Feature Weights (CC, NN), pp. 57–65.
- TAGT-1994-CourcelleS #graph #set
- The Obstructions of a Minor-Closed Set of Graphs Defined by Hyperedge Replacement can be Constructed (BC, GS), pp. 351–367.
- STOC-1993-KleinPR #composition #multi #network
- Excluded minors, network decomposition, and multicommodity flow (PNK, SAP, SR), pp. 682–690.
- ICALP-1993-Gupta #automaton #finite #product line
- Finite Automata as Characterizations of Minor Closed Tree Families (Extended Abstract) (AG), pp. 359–370.
- ICALP-1991-LagergrenA #congruence #finite #using
- Finding Minimal Forbidden Minors Using a Finite Congruence (JL, SA), pp. 532–543.
- STOC-1990-AlonST #graph #theorem
- A Separator Theorem for Graphs with an Excluded Minor and its Applications (NA, PDS, RT), pp. 293–299.
- CSL-1990-ArnborgPS #automaton #higher-order #logic #monad
- Monadic Second Order Logic, Tree Automata and Forbidden Minors (SA, AP, DS), pp. 1–16.