BibSLEIGH corpus
BibSLEIGH tags
BibSLEIGH bundles
BibSLEIGH people
Open Knowledge
XHTML 1.0 W3C Rec
CSS 2.1 W3C CanRec
email twitter
Used together with:
steiner (17)
tree (13)
algorithm (10)
problem (7)
obstacl (5)

Stem rectilinear$ (all stems)

32 papers:

ICALPICALP-v1-2015-MitchellPSW #algorithm
An Optimal Algorithm for Minimum-Link Rectilinear Paths in Triangulated Rectilinear Domains (JSBM, VP, MS, HW), pp. 947–959.
ICALPICALP-v2-2015-KantorK #problem
Optimal Competitiveness for the Rectilinear Steiner Arborescence Problem (EK, SK), pp. 675–687.
ICALPICALP-v2-2014-KantorK #problem #symmetry
Optimal Competitiveness for Symmetric Rectilinear Steiner Arborescence and Related Problems (EK, SK), pp. 520–531.
DACDAC-2012-LiuCL #algorithm #multi #performance
An efficient algorithm for multi-layer obstacle-avoiding rectilinear Steiner tree construction (CHL, ICC, DTL), pp. 613–622.
DACDAC-2011-HuangY #algorithm
An exact algorithm for the construction of rectilinear Steiner minimum trees among complex obstacles (TH, EFYY), pp. 164–169.
DATEDATE-2011-YanC #multi
Obstacle-aware multiple-source rectilinear Steiner tree with electromigration and IR-drop avoidance (JTY, ZWC), pp. 449–454.
DACDAC-2009-LiuYKC #algorithm
An O(n log n) path-based obstacle-avoiding algorithm for rectilinear Steiner tree construction (CHL, SYY, SYK, YHC), pp. 314–319.
AFLAFL-2008-Bercoff #product line
Counting of a family of column-convex rectilinear tiles (CB), pp. 100–110.
CASECASE-2007-CheongS #independence
Computing All Independent Form-Closure Grasp Regions of a Rectilinear Polyhedron (JSC, AFvdS), pp. 288–294.
ICALPICALP-2005-Nilsson #approximate
Approximate Guarding of Monotone and Rectilinear Polygons (BJN), pp. 1362–1373.
SACSAC-2004-JulstromA #algorithm #hybrid #problem
Two hybrid evolutionary algorithms for the rectilinear Steiner arborescence problem (BAJ, AA), pp. 980–984.
ICLPICLP-2004-ErdemW #programming #set #using
Rectilinear Steiner Tree Construction Using Answer Set Programming (EE, MDFW), pp. 386–399.
SACSAC-2003-HareJ #algorithm #problem #search-based
A Spanning Tree-Based Genetic Algorithm for Some Instances of the Rectilinear Steiner Problem with Obstacles (RMH, BAJ), pp. 725–729.
DATEDATE-2002-LinCC #using
Arbitrary Convex and Concave Rectilinear Module Packing Using TCG (JML, HLC, YWC), pp. 69–75.
SACSAC-2001-Julstrom #encoding
Encoding rectilinear Steiner trees as lists of edges (BAJ), pp. 356–360.
Covering Rectilinear Polygons with Axis-Parallel Rectangles (VSAK, HR), pp. 445–454.
Computing Optimized Rectilinear Regions for Association Rules (KY, TF, YM, SM, TT), pp. 96–103.
ICPRICPR-1996-DelagnesB #graph #image #markov #random
Rectilinear structure extraction in textured images with an irregular, graph-based Markov random field model (PD, DB), pp. 800–804.
SACSAC-1996-Julstom #algorithm #representation #search-based
Representing rectilinear Steiner trees in genetic algorithms (BAJ), pp. 245–250.
Rectilinear Steiner Trees with Minimum Elmore Delay (KDB, ABK, BAM, GR), pp. 381–386.
SACSAC-1994-Julstrom #algorithm #performance #problem #search-based
Seeding the population: improved performance in a genetic algorithm for the rectilinear Steiner problem (BAJ), pp. 222–226.
DACDAC-1993-Lee #2d #algorithm #bound #design
A Bounded 2D Contour Searching Algorithm for Floorplan Design with Arbitrarily Shaped Rectilinear and Soft Modules (TcL), pp. 525–530.
DACDAC-1993-LimCW #performance
Performance Oriented Rectilinear Steiner Trees (AL, SWC, CTW), pp. 171–176.
ICDARICDAR-1993-KimSK #diagrams #identification #logic #recognition
Recognition of logic diagrams by identifying loops and rectilinear polylines (SHK, JWS, JHK), pp. 349–352.
ICALPICALP-1990-GoodrichAO #trade-off
An Input-Size/Output-Size Trade-Off in the Time-Complexity of Rectilinear Hidden Surface Removal (Preliminary Version) (MTG, MJA, MHO), pp. 689–702.
ICALPICALP-1990-Hoffmann #on the #problem
On the Rectilinear Art Gallery Problem (Extended Abstract) (FH), pp. 717–728.
DACDAC-1989-HoVW #approach #problem
A New Approach to the Rectilinear Steiner Tree Problem (JMH, GV, CKW), pp. 161–166.
DACDAC-1987-Chi #automation #clustering #standard
An Automatic Rectilinear Partitioning Procedure for Standard Cells (MCC), pp. 50–55.
A language for describing rectilinear Steiner tree configurations (APCN, CDT, PR), pp. 659–662.
STOCSTOC-1986-Bern #probability
Two Probabilistic Results on Rectilinear Steiner Trees (MWB), pp. 433–441.
DACDAC-1984-HudsonWP #algorithm
Module positioning algorithms for rectilinear macrocell assemblies (JAH, JAW, RCP), pp. 672–675.
ICALPICALP-1982-Lingas #power of
The Power of Non-Rectilinear Holes (AL), pp. 369–383.

Bibliography of Software Language Engineering in Generated Hypertext (BibSLEIGH) is created and maintained by Dr. Vadim Zaytsev.
Hosted as a part of SLEBOK on GitHub.