The FacetedDBLP logo    Search for: in:

Disable automatic phrases ?     Syntactic query expansion: ?

Searching for Rectangles with no syntactic query expansion in all metadata.

Publication years (Num. hits)
1960-1981 (17) 1982-1984 (20) 1985-1986 (18) 1987-1988 (32) 1989 (15) 1990 (21) 1991-1992 (22) 1993 (16) 1994 (16) 1995 (24) 1996 (33) 1997 (31) 1998 (19) 1999 (29) 2000 (32) 2001 (34) 2002 (53) 2003 (45) 2004 (68) 2005 (61) 2006 (64) 2007 (61) 2008 (58) 2009 (66) 2010 (25) 2011 (23) 2012-2013 (39) 2014-2015 (29) 2016 (23) 2017 (32) 2018 (22) 2019 (30) 2020 (28) 2021 (29) 2022 (19) 2023 (22) 2024 (3)
Publication types (Num. hits)
article(531) incollection(12) inproceedings(634) phdthesis(2)
Venues (Conferences, Journals, ...)
CoRR(73) Discret. Math.(41) SCG(26) Comput. Geom.(20) J. Comb. Theory, Ser. A(20) SODA(18) FOCS(17) CCCG(16) ESA(15) GD(14) IEEE Trans. Comput. Aided Des....(14) SIGMOD Conference(14) Algorithmica(13) Electron. J. Comb.(13) ICDAR(13) STOC(13) More (+10 of total 452)
GrowBag graphs for keyword ? (Num. hits/coverage)

Group by:
The graphs summarize 587 occurrences of 439 keywords

Results
Found 1179 publication records. Showing 1179 according to the selection in the facets
Hits ? Authors Title Venue Year Link Author keywords
88Parinya Chalermsook, Julia Chuzhoy Maximum independent set of rectangles. Search on Bibsonomy SODA The full citation details ... 2009 DBLP  DOI  BibTeX  RDF
81Takayuki Itoh, Yumi Yamaguchi, Yuko Ikehata, Yasumasa Kajinaga Hierarchical Data Visualization Using a Fast Rectangle-Packing Algorithm. Search on Bibsonomy IEEE Trans. Vis. Comput. Graph. The full citation details ... 2004 DBLP  DOI  BibTeX  RDF Delaunay triangular mesh, rectangle packing, Hierarchical data
70Josef Kallrath Cutting circles and polygons from area-minimizing rectangles. Search on Bibsonomy J. Glob. Optim. The full citation details ... 2009 DBLP  DOI  BibTeX  RDF Non-overlap constraints, Global Optimization, Mixed integer programming, Assignment, Packing problem, Cutting stock problem, Shape constraints, Design problem
70Adrian Dumitrescu, Joseph S. B. Mitchell, Micha Sharir Binary Space Partitions for Axis-Parallel Segments, Rectangles, and Hyperrectangles. Search on Bibsonomy Discret. Comput. Geom. The full citation details ... 2004 DBLP  DOI  BibTeX  RDF
61Hui Kong 0002, Qiang Ma 0002, Tan Yan, Martin D. F. Wong An optimal algorithm for finding disjoint rectangles and its application to PCB routing. Search on Bibsonomy DAC The full citation details ... 2010 DBLP  DOI  BibTeX  RDF PCB routing, maximum independent subset, escape routing
61Fabio Parisini Bi-dimensional Domains for the Non-overlapping Rectangles Constraint. Search on Bibsonomy ICLP The full citation details ... 2008 DBLP  DOI  BibTeX  RDF
61Noboru Takagi An Agglomerative Hierarchical Clustering by Finding Adjacent Hyper-Rectangles. Search on Bibsonomy RSCTC The full citation details ... 2006 DBLP  DOI  BibTeX  RDF heap sort, combinatorial optimization problem, agglomerative hierarchical clustering
61Hiroshi Nagamochi, Yuusuke Abe An Approximation Algorithm for Dissecting a Rectangle into Rectangles with Specified Areas. Search on Bibsonomy ISAAC The full citation details ... 2003 DBLP  DOI  BibTeX  RDF
61Thomas M. Breuel An Algorithm for Finding Maximal Whitespace Rectangles at Arbitrary Orientations for Document Layout Analysis. Search on Bibsonomy ICDAR The full citation details ... 2003 DBLP  DOI  BibTeX  RDF
61Adrian Dumitrescu, Joseph S. B. Mitchell, Micha Sharir Binary space partitions for axis-parallel segments, rectangles, and hyperrectangles. Search on Bibsonomy SCG The full citation details ... 2001 DBLP  DOI  BibTeX  RDF
59Pankaj K. Agarwal, Edward F. Grove, T. M. Murali 0001, Jeffrey Scott Vitter Binary Search Partitions for Fat Rectangles. Search on Bibsonomy FOCS The full citation details ... 1996 DBLP  DOI  BibTeX  RDF fat rectangles, orthogonal nonintersecting two-dimensional rectangles, proportionality constants, intersecting objects, nonorthogonal objects, algorithm, computational complexity, computation time, binary space partitions, aspect ratio, hidden surface removal
55Ying Cheng 0006, S. Sitharama Iyengar, Rangasami L. Kashyap A New Method of Image Compression using Irreducible Covers of Maximum Rectangles. Search on Bibsonomy IEEE Trans. Software Eng. The full citation details ... 1988 DBLP  DOI  BibTeX  RDF irreducible covers, maximal rectangles, concurrent-read-exclusive write, parallel algorithm, parallel algorithms, data structures, data compression, computerised picture processing, image compression, pixels
54Alberto Belussi, Elisa Bertino, Andrea Nucita Grid based methods for estimating spatial join selectivity. Search on Bibsonomy GIS The full citation details ... 2004 DBLP  DOI  BibTeX  RDF GIS, query optimization, spatial join
54Ileana Streinu, Sue Whitesides Rectangle Visibility Graphs: Characterization, Construction, and Compaction. Search on Bibsonomy STACS The full citation details ... 2003 DBLP  DOI  BibTeX  RDF
52Laurent Tournier, Jean-Luc Gouzé Qualitative Stability Patterns for Lotka-Volterra Systems on Rectangles. Search on Bibsonomy HSCC The full citation details ... 2008 DBLP  DOI  BibTeX  RDF
52Klaus Jansen, Guochuan Zhang Maximizing the Total Profit of Rectangles Packed into a Rectangle. Search on Bibsonomy Algorithmica The full citation details ... 2007 DBLP  DOI  BibTeX  RDF
52Toshihide Ibaraki, Kouji Nakamura Packing Problems with Soft Rectangles. Search on Bibsonomy Hybrid Metaheuristics The full citation details ... 2006 DBLP  DOI  BibTeX  RDF
52Edward G. Coffman Jr., Peter J. Downey, Peter M. Winkler Packing rectangles in a strip. Search on Bibsonomy Acta Informatica The full citation details ... 2002 DBLP  DOI  BibTeX  RDF
52Jeff Edmonds, Jarek Gryz, Dongming Liang, Renée J. Miller Mining for Empty Rectangles in Large Data Sets. Search on Bibsonomy ICDT The full citation details ... 2001 DBLP  DOI  BibTeX  RDF
52Ingo Schiermeyer Reverse-Fit: A 2-Optimal Algorithm for Packing Rectangles. Search on Bibsonomy ESA The full citation details ... 1994 DBLP  DOI  BibTeX  RDF level-oriented packing algorithm, two-dimensional packing, k-rectangle packing problem, rectangle packing conjecture, bin-packing
52Marc J. van Kreveld, Mark de Berg Finding Squares and Rectangles in Sets of Points. Search on Bibsonomy WG The full citation details ... 1989 DBLP  DOI  BibTeX  RDF
48Tobias Emrich, Hans-Peter Kriegel, Peer Kröger, Matthias Renz, Andreas Züfle Boosting spatial pruning: on optimal pruning of MBRs. Search on Bibsonomy SIGMOD Conference The full citation details ... 2010 DBLP  DOI  BibTeX  RDF rknn, pruning, spatial, knn, rectangles
48Marina L. Gavrilova Two Map Labeling Algorithms for GIS Applications. Search on Bibsonomy ICCSA (1) The full citation details ... 2006 DBLP  DOI  BibTeX  RDF map labeling for polygons with holes, polygonal area removal, sweep algorithm, set of maximum inscribed rectangles, GIS
45Lars Arge, Mark de Berg, Herman J. Haverkort Cache-Oblivious R-Trees. Search on Bibsonomy Algorithmica The full citation details ... 2009 DBLP  DOI  BibTeX  RDF Cache-oblivious data structures, R-trees, Geometric data structures, I/O-efficiency
45Ali Jaoua, Rehab M. Duwairi, Samir Elloumi, Sadok Ben Yahia Data Mining, Reasoning and Incremental Information Retrieval through Non Enlargeable Rectangular Relation Coverage. Search on Bibsonomy RelMiCS The full citation details ... 2009 DBLP  DOI  BibTeX  RDF Formal Concept Analysis, Galois Connection, Minimal representation
45John Augustine, Sudarshan Banerjee, Sandy Irani Strip packing with precedence constraints and strip packing with release times. Search on Bibsonomy SPAA The full citation details ... 2006 DBLP  DOI  BibTeX  RDF scheduling, reconfigurable architectures, precedence constraints, release times, strip packing
45Mattias Andersson 0002, Joachim Gudmundsson, Christos Levcopoulos Chips on Wafers. Search on Bibsonomy WADS The full citation details ... 2003 DBLP  DOI  BibTeX  RDF
43Peyman Afshani, Timothy M. Chan Dynamic Connectivity for Axis-Parallel Rectangles. Search on Bibsonomy Algorithmica The full citation details ... 2009 DBLP  DOI  BibTeX  RDF Dynamic connectivity, Data structures, Computational geometry, Dynamic data structures
43Genhong Ding, Dan Li, Leng Chen Solving the packing problem of rectangles with improved genetic algorithm based on statistical analysis. Search on Bibsonomy GEC Summit The full citation details ... 2009 DBLP  DOI  BibTeX  RDF orthogonal packing, packing pattern, surplus rectangle, genetic algorithm, statistical analysis
43Peyman Afshani, Timothy M. Chan Dynamic Connectivity for Axis-Parallel Rectangles. Search on Bibsonomy ESA The full citation details ... 2006 DBLP  DOI  BibTeX  RDF
43Jun-Sik Kim 0001, In-So Kweon Infinite Homography Estimation Using Two Arbitrary Planar Rectangles. Search on Bibsonomy ACCV (2) The full citation details ... 2006 DBLP  DOI  BibTeX  RDF
43Aleksei V. Fishkin, Olga Gerber, Klaus Jansen, Roberto Solis-Oba Packing Weighted Rectangles into a Square. Search on Bibsonomy MFCS The full citation details ... 2005 DBLP  DOI  BibTeX  RDF
43Klaus Jansen, Guochuan Zhang Maximizing the Number of Packed Rectangles. Search on Bibsonomy SWAT The full citation details ... 2004 DBLP  DOI  BibTeX  RDF
43Olivier Beaumont, Vincent Boudet, Fabrice Rastello, Yves Robert Partitioning a Square into Rectangles: NP-Completeness and Approximation Algorithms. Search on Bibsonomy Algorithmica The full citation details ... 2002 DBLP  DOI  BibTeX  RDF
43Herbert Süße, Klaus Voss A new efficient algorithm for fitting of rectangles and squares. Search on Bibsonomy ICIP (2) The full citation details ... 2001 DBLP  DOI  BibTeX  RDF
43Kunihiko Hayashi, Michiko Inoue, Toshimitsu Masuzawa, Hideo Fujiwara A Layout Adjustment Problem for Disjoint Rectangles Preserving Orthogonal Order. Search on Bibsonomy GD The full citation details ... 1998 DBLP  DOI  BibTeX  RDF
43Zhixiang Chen 0001, Wolfgang Maass 0001 On-line Learning of Rectangles. Search on Bibsonomy COLT The full citation details ... 1992 DBLP  DOI  BibTeX  RDF
43R. Shantaram, John Stewart An algorithm to minimally decompose a rectilinear figure into rectangles (abstract only). Search on Bibsonomy ACM Conference on Computer Science The full citation details ... 1987 DBLP  DOI  BibTeX  RDF
43Jon Louis Bentley, Thomas Ottmann The Complexity of Manipulating Hierarchically Defined Sets of Rectangles. Search on Bibsonomy MFCS The full citation details ... 1981 DBLP  DOI  BibTeX  RDF
39Liane Lewin-Eytan, Joseph Naor, Ariel Orda Admission Control in Networks with Advance Reservations. Search on Bibsonomy Algorithmica The full citation details ... 2004 DBLP  DOI  BibTeX  RDF Line network, Axis parallel rectangles, Approximation algorithms, Independent set, Advance reservations, Local ratio
37Peter Auer, Philip M. Long, Aravind Srinivasan Approximating Hyper-Rectangles: Learning and Pseudo-Random Sets. Search on Bibsonomy STOC The full citation details ... 1997 DBLP  DOI  BibTeX  RDF approximations of distributions, machine learning, random graphs, derandomization, pseudorandomness, PAC learning, multiple-instance learning, rectangles, sample complexity, explicit constructions, Ramsey graphs
37Roy Armoni, Michael E. Saks, Avi Wigderson, Shiyu Zhou Discrepancy Sets and Pseudorandom Generators for Combinatorial Rectangles. Search on Bibsonomy FOCS The full citation details ... 1996 DBLP  DOI  BibTeX  RDF discrepancy sets, combinatorial rectangles, common subproblem, DNF approximate counting, discrepancy problem, poly(n)-size sample space, random number generation, pseudorandom generators
37Claire Kenyon, Richard W. Kenyon Tiling a Polygon with Rectangles Search on Bibsonomy FOCS The full citation details ... 1992 DBLP  DOI  BibTeX  RDF quadratic algorithm, time complexity, geometry, tiling, polygon, linear time algorithm, rectangles
36Alberto Caprara, Michele Monaci Bidimensional packing by bilinear programming. Search on Bibsonomy Math. Program. The full citation details ... 2009 DBLP  DOI  BibTeX  RDF Mathematics Subject Classification (2000) 52C15
36David Eppstein, Elena Mumford, Bettina Speckmann, Kevin Verbeek Area-universal rectangular layouts. Search on Bibsonomy SCG The full citation details ... 2009 DBLP  DOI  BibTeX  RDF rectangular layouts
36Alberto Caprara, Marco Locatelli 0001, Michele Monaci Bidimensional Packing by Bilinear Programming. Search on Bibsonomy IPCO The full citation details ... 2005 DBLP  DOI  BibTeX  RDF
36Lars Arge, Mark de Berg, Herman J. Haverkort Cache-oblivious r-trees. Search on Bibsonomy SCG The full citation details ... 2005 DBLP  DOI  BibTeX  RDF cache-oblivious data structures, R-trees, geometric data structures, I/O-efficiency
36José R. Correa, Claire Kenyon Approximation schemes for multidimensional packing. Search on Bibsonomy SODA The full citation details ... 2004 DBLP  BibTeX  RDF
36Klaus Jansen, Guochuan Zhang On rectangle packing: maximizing benefits. Search on Bibsonomy SODA The full citation details ... 2004 DBLP  BibTeX  RDF
36Alberto Caprara, Andrea Lodi 0001, Michele Monaci An Approximation Scheme for the Two-Stage, Two-Dimensional Bin Packing Problem. Search on Bibsonomy IPCO The full citation details ... 2002 DBLP  DOI  BibTeX  RDF
36Norio Katayama, Shin'ichi Satoh 0001 The SR-tree: An Index Structure for High-Dimensional Nearest Neighbor Queries. Search on Bibsonomy SIGMOD Conference The full citation details ... 1997 DBLP  DOI  BibTeX  RDF
34Ke Chen 0006, Haim Kaplan, Micha Sharir Online conflict-free coloring for halfplanes, congruent disks, and axis-parallel rectangles. Search on Bibsonomy ACM Trans. Algorithms The full citation details ... 2009 DBLP  DOI  BibTeX  RDF Conflict free coloring, online algorithms, coloring
34Mathias Ortner, Xavier Descombes, Josiane Zerubia A Marked Point Process of Rectangles and Segments for Automatic Analysis of Digital Elevation Models. Search on Bibsonomy IEEE Trans. Pattern Anal. Mach. Intell. The full citation details ... 2008 DBLP  DOI  BibTeX  RDF dense urban area, land register, RJMCMC, Image processing, simulated annealing, MCMC, stochastic geometry, Poisson point process, Digital Elevation Models, building detection
34Hee-Kap Ahn, Sang Won Bae Covering a Point Set by Two Disjoint Rectangles. Search on Bibsonomy ISAAC The full citation details ... 2008 DBLP  DOI  BibTeX  RDF
34Rolf Harren, Rob van Stee Packing Rectangles into 2OPT Bins Using Rotations. Search on Bibsonomy SWAT The full citation details ... 2008 DBLP  DOI  BibTeX  RDF absolute worst-case ratio, approximation algorithm, bin packing, rectangle packing
34Yakov Nekrich I/O-Efficient Point Location in a Set of Rectangles. Search on Bibsonomy LATIN The full citation details ... 2008 DBLP  DOI  BibTeX  RDF
34Chandan Saha 0001, Sandip Das 0001 Covering a Set of Points in a Plane Using Two Parallel Rectangles. Search on Bibsonomy ICCTA The full citation details ... 2007 DBLP  DOI  BibTeX  RDF
34Eynat Rafalin, Diane L. Souvaine, Csaba D. Tóth Cuttings for Disks and Axis-Aligned Rectangles. Search on Bibsonomy WADS The full citation details ... 2007 DBLP  DOI  BibTeX  RDF
34Alp Atici, Rocco A. Servedio Learning Unions of omega(1)-Dimensional Rectangles. Search on Bibsonomy ALT The full citation details ... 2006 DBLP  DOI  BibTeX  RDF
34Jun-Sik Kim 0001, In-So Kweon Estimating Intrinsic Parameters of Cameras using Two Arbitrary Rectangles. Search on Bibsonomy ICPR (1) The full citation details ... 2006 DBLP  DOI  BibTeX  RDF
34I-Lun Tseng, Adam Postula An efficient algorithm for partitioning parameterized polygons into rectangles. Search on Bibsonomy ACM Great Lakes Symposium on VLSI The full citation details ... 2006 DBLP  DOI  BibTeX  RDF corner stitching, parameterized layouts, parameterized polygons, polygon decomposition
34Eric Rémila Tiling a Polygon with Two Kinds of Rectangles. Search on Bibsonomy Discret. Comput. Geom. The full citation details ... 2005 DBLP  DOI  BibTeX  RDF
34Eric Rémila Tiling a Polygon with Two Kinds of Rectangles. Search on Bibsonomy ESA The full citation details ... 2004 DBLP  DOI  BibTeX  RDF
34Jarkko Kari, Cristopher Moore Rectangles and Squares Recognized by Two-Dimensional Automata. Search on Bibsonomy Theory Is Forever The full citation details ... 2004 DBLP  DOI  BibTeX  RDF
34Luigi Cinque, Fabio De Rosa, Fabio Lecca, Stefano Levialdi, Steven L. Tanimoto Image Retrieval Using Resegmentation Driven by Query Rectangles. Search on Bibsonomy ICPR (4) The full citation details ... 2002 DBLP  DOI  BibTeX  RDF
34San-Yuan Wu, Sartaj Sahni Covering rectilinear polygons by rectangles. Search on Bibsonomy IEEE Trans. Comput. Aided Des. Integr. Circuits Syst. The full citation details ... 1990 DBLP  DOI  BibTeX  RDF
34Norbert Beckmann, Hans-Peter Kriegel, Ralf Schneider, Bernhard Seeger The R*-Tree: An Efficient and Robust Access Method for Points and Rectangles. Search on Bibsonomy SIGMOD Conference The full citation details ... 1990 DBLP  DOI  BibTeX  RDF
34Jiahuang Ji, Menkae Jeng Bin-packing adjustable rectangles and applications to task scheduling on partitionable parallel computers. Search on Bibsonomy SPDP The full citation details ... 1990 DBLP  DOI  BibTeX  RDF
34Otfried Schwarzkopf, Ulrich Fuchs 0001, Günter Rote, Emo Welzl Approximation of Convex Figures by Pairs of Rectangles. Search on Bibsonomy STACS The full citation details ... 1990 DBLP  DOI  BibTeX  RDF
34Subhas C. Nandy, Bhargab B. Bhattacharya, Sibabrata Ray Efficient algorithms for Identifying All Maximal Isothetic Empty Rectangles in VLSI Layout Design. Search on Bibsonomy FSTTCS The full citation details ... 1990 DBLP  DOI  BibTeX  RDF interval trees, complexity, Computational geometry, placement, VLSI layout, geometric algorithms
34Marshall W. Bern Hidden Surface Removal for Rectangles. Search on Bibsonomy SCG The full citation details ... 1988 DBLP  DOI  BibTeX  RDF
34Sching L. Lin, Jonathan Allen Minplex - a compactor that minimizes the bounding rectangle and individual rectangles in a layout. Search on Bibsonomy DAC The full citation details ... 1986 DBLP  DOI  BibTeX  RDF
34Christos Levcopoulos, Andrzej Lingas Covering Polygons with Minimum Number of Rectangles. Search on Bibsonomy STACS The full citation details ... 1984 DBLP  DOI  BibTeX  RDF
32Gerold Jäger, Klas Markström, Denys Shcherbak, Lars-Daniel Öhman Small Youden Rectangles, Near Youden Rectangles, and Their Connections to Other Row-Column Designs. Search on Bibsonomy Discret. Math. Theor. Comput. Sci. The full citation details ... 2023 DBLP  DOI  BibTeX  RDF
32Marco Caoduro Geometric challenges in combinatorial optimization : packing, hitting, and coloring rectangles. (Problèmes de géométrie en optimisation combinatoire : packing, transversaux, et coloration de rectangles). Search on Bibsonomy 2022   RDF
32Anna Adamaszek, Parinya Chalermsook, Andreas Wiese How to Tame Rectangles: Solving Independent Set and Coloring of Rectangles via Shrinking. Search on Bibsonomy APPROX-RANDOM The full citation details ... 2015 DBLP  DOI  BibTeX  RDF
32Radim Belohlávek, Vilém Vychodil Replacing full rectangles by dense rectangles: Concept lattices and attribute implications. Search on Bibsonomy IRI The full citation details ... 2006 DBLP  DOI  BibTeX  RDF
32Zhixiang Chen 0001, Wolfgang Maass 0001 On-Line Learning of Rectangles and Unions of Rectangles. Search on Bibsonomy Mach. Learn. The full citation details ... 1994 DBLP  DOI  BibTeX  RDF
32Bruno Becker, Paolo Giulio Franciosa, Stephan Gschwind, Thomas Ohler, Gerald Thiemt, Peter Widmayer An Optimal Algorithm for Approximating a Set of Rectangles by Two Minimum Area Rectangles. Search on Bibsonomy Workshop on Computational Geometry The full citation details ... 1991 DBLP  DOI  BibTeX  RDF
30Ratko Orlandic, Byunggu Yu A Study of MBR-Based Spatial Access Methods: How Well They Perform in High-Dimensional Spaces. Search on Bibsonomy IDEAS The full citation details ... 2000 DBLP  DOI  BibTeX  RDF MBR based spatial access methods, spatial applications, extended objects, minimum bounding rectangles, MBRs, conceptual problems, MBR based SAMs, MBR based structure, QSF-trees, high dimensional data, spatial data, spatial data structures, high dimensionality, high dimensional spaces
30Claudia I. Horta, José A. Lima Slicing and non-slicing, unified and rotation independent, algebraic representation of floorplans. Search on Bibsonomy EUROMICRO The full citation details ... 1997 DBLP  DOI  BibTeX  RDF floorplan area optimization problem, rectangle envelope, nonoverlapping basic rectangles, floorplan topology, formal algebraic specification, SETS notation, VLSI physical design layout, module dimensions, arbitrarily complex composite floorplans, rotation-invariant single-expression formalism, generalized wheels floorplans, slicing representation, nonslicing representation, unified representation, topology-dimensionless description, floorplanning problem algorithms, algebraic specification, line segments, relative positioning
30J. T. Mowchenko, Y. Yang Optimizing wiring space in slicing floorplans. Search on Bibsonomy Great Lakes Symposium on VLSI The full citation details ... 1995 DBLP  DOI  BibTeX  RDF wiring space optimisation, slicing floorplans, net density, sibling rectangles, circuit modules, routed layouts, VLSI, heuristic, network routing, circuit layout CAD, circuit optimisation, integrated circuit layout, branch and bound algorithm, wiring, IC layout
27Mingxi Wu, Xiuyao Song, Chris Jermaine, Sanjay Ranka, John Gums A LRT framework for fast spatial anomaly detection. Search on Bibsonomy KDD The full citation details ... 2009 DBLP  DOI  BibTeX  RDF LRT spatial anomaly
27Hsiu-ching Hsieh, Chih-Chieh Hsiao, Hui-Chin Yang, Chung-Ping Chung, Jean Jyh-Jiun Shann Methods for Precise False-Overlap Detection in Tile-Based Rendering. Search on Bibsonomy CSE (2) The full citation details ... 2009 DBLP  DOI  BibTeX  RDF
27Deshi Ye, Xin Han, Guochuan Zhang On-Line Multiple-Strip Packing. Search on Bibsonomy COCOA The full citation details ... 2009 DBLP  DOI  BibTeX  RDF many-core scheduling, approximation algorithms, Strip packing
27Francis Y. L. Chin, Hing-Fung Ting, Yong Zhang 0001 Variable-Size Rectangle Covering. Search on Bibsonomy COCOA The full citation details ... 2009 DBLP  DOI  BibTeX  RDF
27Toshihiko Takahashi, Ryo Fujimaki, Youhei Inoue A (4n - 4)-Bit Representation of a Rectangular Drawing or Floorplan. Search on Bibsonomy COCOON The full citation details ... 2009 DBLP  DOI  BibTeX  RDF
27Igor Timko, Michael H. Böhlen, Johann Gamper Sequenced spatio-temporal aggregation in road networks. Search on Bibsonomy EDBT The full citation details ... 2009 DBLP  DOI  BibTeX  RDF
27Guy Even, Retsef Levi, Dror Rawitz, Baruch Schieber, Shimon Shahar, Maxim Sviridenko Algorithms for capacitated rectangle stabbing and lot sizing with joint set-up costs. Search on Bibsonomy ACM Trans. Algorithms The full citation details ... 2008 DBLP  DOI  BibTeX  RDF capacitated covering, rectangle stabbing, Approximation algorithms, lot sizing
27Branislav Micusík, Horst Wildenauer, Jana Kosecka Detection and matching of rectilinear structures. Search on Bibsonomy CVPR The full citation details ... 2008 DBLP  DOI  BibTeX  RDF
27Alexey L. Lastovetsky On Grid-based Matrix Partitioning for Heterogeneous Processors. Search on Bibsonomy ISPDC The full citation details ... 2007 DBLP  DOI  BibTeX  RDF
27Chandan Giri, Soumojit Sarkar, Santanu Chattopadhyay A genetic algorithm based heuristic technique for power constrained test scheduling in core-based SOCs. Search on Bibsonomy VLSI-SoC The full citation details ... 2007 DBLP  DOI  BibTeX  RDF
27Klaus Jansen, Roberto Solis-Oba New Approximability Results for 2-Dimensional Packing Problems. Search on Bibsonomy MFCS The full citation details ... 2007 DBLP  DOI  BibTeX  RDF
27Adam L. Buchsbaum, Emden R. Gansner, Suresh Venkatasubramanian Directed graphs and rectangular layouts. Search on Bibsonomy APVIS The full citation details ... 2007 DBLP  DOI  BibTeX  RDF
27Chandan Giri, Soumojit Sarkar, Santanu Chattopadhyay Test Scheduling for Core-Based SOCs Using Genetic Algorithm Based Heuristic Approach. Search on Bibsonomy ICIC (2) The full citation details ... 2007 DBLP  DOI  BibTeX  RDF wrapper design, test scheduling, test access mechanism, SOC testing
27Stefan Porschen Optimal Parameterized Rectangular Coverings. Search on Bibsonomy ICCSA (1) The full citation details ... 2007 DBLP  DOI  BibTeX  RDF parameterized rectangular covering, integer grid, dynamic programming, NP-hardness, optimization problem, exact algorithmics, closure operator
27Guy Even, Dror Rawitz, Shimon Shahar Approximation Algorithms for Capacitated Rectangle Stabbing. Search on Bibsonomy CIAC The full citation details ... 2006 DBLP  DOI  BibTeX  RDF
27Aleksei V. Fishkin, Olga Gerber, Klaus Jansen On Efficient Weighted Rectangle Packing with Large Resources. Search on Bibsonomy ISAAC The full citation details ... 2005 DBLP  DOI  BibTeX  RDF approximation, resources, rectangle packing
27Martha J. Kosa, Mark A. Boshart Treemap visualizations for CS2. Search on Bibsonomy ITiCSE The full citation details ... 2004 DBLP  DOI  BibTeX  RDF
27Stefan Porschen On the Time Complexity of Rectangular Covering Problems in the Discrete Plane. Search on Bibsonomy ICCSA (3) The full citation details ... 2004 DBLP  DOI  BibTeX  RDF rectangular set cover, integer lattice, NP-completeness, discrete plane
Displaying result #1 - #100 of 1179 (100 per page; Change: )
Pages: [1][2][3][4][5][6][7][8][9][10][>>]
Valid XHTML 1.1! Valid CSS! [Valid RSS]
Maintained by L3S.
Previously maintained by Jörg Diederich.
Based upon DBLP by Michael Ley.
open data data released under the ODC-BY 1.0 license