### 14 papers:

- ICALP-v1-2015-GiannopoulouJLS #complexity #kernel
- Uniform Kernelization Complexity of Hitting Forbidden Minors (ACG, BMPJ, DL, SS), pp. 629–641.
- ICALP-v1-2015-KawaseKY #graph
- Finding a Path in Group-Labeled Graphs with Two Labels Forbidden (YK, YK, YY), pp. 797–809.
- STOC-2012-AbrahamCG #approximate #distance #graph
- Fully dynamic approximate distance oracles for planar graphs via forbidden-set distance labels (IA, SC, CG), pp. 1199–1218.
- STOC-2009-LeeS #geometry #graph #on the
- On the geometry of graphs with a forbidden minor (JRL, AS), pp. 245–254.
- DAC-2008-DuanZK #design
- Forbidden transition free crosstalk avoidance CODEC design (CD, CZ, SPK), pp. 986–991.
- CSL-2006-Madelaine #logic
- Universal Structures and the Logic of Forbidden Patterns (FRM), pp. 471–485.
- MBT-2006-BourdonovKK #consistency #testing
- Formal Conformance Testing of Systems with Refused Inputs and Forbidden Actions (IBB, AK, VVK), pp. 83–96.
- DLT-2001-MignosiRS #assembly
- Forbidden Factors and Fragment Assembly (FM, AR, MS), pp. 349–358.
- ICALP-2000-Grigni #approximate #graph
- Approximate TSP in Graphs with Forbidden Minors (MG), pp. 869–877.
- STOC-1991-DjidjevR #algorithm #performance #problem
- An Efficient Algorithm for the Genus Problem with Explicit Construction of Forbidden Subgraphs (HD, JHR), pp. 337–347.
- ICALP-1991-LagergrenA #congruence #finite #using
- Finding Minimal Forbidden Minors Using a Finite Congruence (JL, SA), pp. 532–543.
- CSL-1990-ArnborgPS #automaton #higher-order #logic #monad
- Monadic Second Order Logic, Tree Automata and Forbidden Minors (SA, AP, DS), pp. 1–16.
- GG-1982-Wankmuller #graph #reduction
- Characterization of graph classes by forbidden structures and reductions (FW), pp. 405–414.
- STOC-1976-HuntS #problem #reachability
- Dichotomization, Reachability, and the Forbidden Subgraph Problem (Extended Abstract) (HBHI, TGS), pp. 126–134.