|
|
Venues (Conferences, Journals, ...)
|
|
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 |
88 | Parinya Chalermsook, Julia Chuzhoy |
Maximum independent set of rectangles. ![Search on Bibsonomy](Pics/bibsonomy.png) |
SODA ![In: Proceedings of the Twentieth Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2009, New York, NY, USA, January 4-6, 2009, pp. 892-901, 2009, SIAM, 978-0-89871-680-1. The full citation details ...](Pics/full.jpeg) |
2009 |
DBLP DOI BibTeX RDF |
|
81 | Takayuki Itoh, Yumi Yamaguchi, Yuko Ikehata, Yasumasa Kajinaga |
Hierarchical Data Visualization Using a Fast Rectangle-Packing Algorithm. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IEEE Trans. Vis. Comput. Graph. ![In: IEEE Trans. Vis. Comput. Graph. 10(3), pp. 302-313, 2004. The full citation details ...](Pics/full.jpeg) |
2004 |
DBLP DOI BibTeX RDF |
Delaunay triangular mesh, rectangle packing, Hierarchical data |
70 | Josef Kallrath |
Cutting circles and polygons from area-minimizing rectangles. ![Search on Bibsonomy](Pics/bibsonomy.png) |
J. Glob. Optim. ![In: J. Glob. Optim. 43(2-3), pp. 299-328, 2009. The full citation details ...](Pics/full.jpeg) |
2009 |
DBLP DOI BibTeX RDF |
Non-overlap constraints, Global Optimization, Mixed integer programming, Assignment, Packing problem, Cutting stock problem, Shape constraints, Design problem |
70 | Adrian Dumitrescu, Joseph S. B. Mitchell, Micha Sharir |
Binary Space Partitions for Axis-Parallel Segments, Rectangles, and Hyperrectangles. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Discret. Comput. Geom. ![In: Discret. Comput. Geom. 31(2), pp. 207-227, 2004. The full citation details ...](Pics/full.jpeg) |
2004 |
DBLP DOI BibTeX RDF |
|
61 | Hui 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](Pics/bibsonomy.png) |
DAC ![In: Proceedings of the 47th Design Automation Conference, DAC 2010, Anaheim, California, USA, July 13-18, 2010, pp. 212-217, 2010, ACM, 978-1-4503-0002-5. The full citation details ...](Pics/full.jpeg) |
2010 |
DBLP DOI BibTeX RDF |
PCB routing, maximum independent subset, escape routing |
61 | Fabio Parisini |
Bi-dimensional Domains for the Non-overlapping Rectangles Constraint. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ICLP ![In: Logic Programming, 24th International Conference, ICLP 2008, Udine, Italy, December 9-13 2008, Proceedings, pp. 811-812, 2008, Springer, 978-3-540-89981-5. The full citation details ...](Pics/full.jpeg) |
2008 |
DBLP DOI BibTeX RDF |
|
61 | Noboru Takagi |
An Agglomerative Hierarchical Clustering by Finding Adjacent Hyper-Rectangles. ![Search on Bibsonomy](Pics/bibsonomy.png) |
RSCTC ![In: Rough Sets and Current Trends in Computing, 5th International Conference, RSCTC 2006, Kobe, Japan, November 6-8, 2006, Proceedings, pp. 677-686, 2006, Springer, 3-540-47693-8. The full citation details ...](Pics/full.jpeg) |
2006 |
DBLP DOI BibTeX RDF |
heap sort, combinatorial optimization problem, agglomerative hierarchical clustering |
61 | Hiroshi Nagamochi, Yuusuke Abe |
An Approximation Algorithm for Dissecting a Rectangle into Rectangles with Specified Areas. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ISAAC ![In: Algorithms and Computation, 14th International Symposium, ISAAC 2003, Kyoto, Japan, December 15-17, 2003, Proceedings, pp. 280-289, 2003, Springer, 3-540-20695-7. The full citation details ...](Pics/full.jpeg) |
2003 |
DBLP DOI BibTeX RDF |
|
61 | Thomas M. Breuel |
An Algorithm for Finding Maximal Whitespace Rectangles at Arbitrary Orientations for Document Layout Analysis. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ICDAR ![In: 7th International Conference on Document Analysis and Recognition (ICDAR 2003), 2-Volume Set, 3-6 August 2003, Edinburgh, Scotland, UK, pp. 66-70, 2003, IEEE Computer Society, 0-7695-1960-1. The full citation details ...](Pics/full.jpeg) |
2003 |
DBLP DOI BibTeX RDF |
|
61 | Adrian Dumitrescu, Joseph S. B. Mitchell, Micha Sharir |
Binary space partitions for axis-parallel segments, rectangles, and hyperrectangles. ![Search on Bibsonomy](Pics/bibsonomy.png) |
SCG ![In: Proceedings of the Seventeenth Annual Symposium on Computational Geometry, Medford, MA, USA, June 3-5, 2001, pp. 141-150, 2001, ACM, 1-58113-357-X. The full citation details ...](Pics/full.jpeg) |
2001 |
DBLP DOI BibTeX RDF |
|
59 | Pankaj K. Agarwal, Edward F. Grove, T. M. Murali 0001, Jeffrey Scott Vitter |
Binary Search Partitions for Fat Rectangles. ![Search on Bibsonomy](Pics/bibsonomy.png) |
FOCS ![In: 37th Annual Symposium on Foundations of Computer Science, FOCS '96, Burlington, Vermont, USA, 14-16 October, 1996, pp. 482-491, 1996, IEEE Computer Society, 0-8186-7594-2. The full citation details ...](Pics/full.jpeg) |
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 |
55 | Ying Cheng 0006, S. Sitharama Iyengar, Rangasami L. Kashyap |
A New Method of Image Compression using Irreducible Covers of Maximum Rectangles. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IEEE Trans. Software Eng. ![In: IEEE Trans. Software Eng. 14(5), pp. 651-658, 1988. The full citation details ...](Pics/full.jpeg) |
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 |
54 | Alberto Belussi, Elisa Bertino, Andrea Nucita |
Grid based methods for estimating spatial join selectivity. ![Search on Bibsonomy](Pics/bibsonomy.png) |
GIS ![In: 12th ACM International Workshop on Geographic Information Systems, ACM-GIS 2004, November 12-13, 2004, Washington, DC, USA, Proceedings, pp. 92-100, 2004, ACM, 1-58113-979-9. The full citation details ...](Pics/full.jpeg) |
2004 |
DBLP DOI BibTeX RDF |
GIS, query optimization, spatial join |
54 | Ileana Streinu, Sue Whitesides |
Rectangle Visibility Graphs: Characterization, Construction, and Compaction. ![Search on Bibsonomy](Pics/bibsonomy.png) |
STACS ![In: STACS 2003, 20th Annual Symposium on Theoretical Aspects of Computer Science, Berlin, Germany, February 27 - March 1, 2003, Proceedings, pp. 26-37, 2003, Springer, 3-540-00623-0. The full citation details ...](Pics/full.jpeg) |
2003 |
DBLP DOI BibTeX RDF |
|
52 | Laurent Tournier, Jean-Luc Gouzé |
Qualitative Stability Patterns for Lotka-Volterra Systems on Rectangles. ![Search on Bibsonomy](Pics/bibsonomy.png) |
HSCC ![In: Hybrid Systems: Computation and Control, 11th International Workshop, HSCC 2008, St. Louis, MO, USA, April 22-24, 2008. Proceedings, pp. 662-665, 2008, Springer, 978-3-540-78928-4. The full citation details ...](Pics/full.jpeg) |
2008 |
DBLP DOI BibTeX RDF |
|
52 | Klaus Jansen, Guochuan Zhang |
Maximizing the Total Profit of Rectangles Packed into a Rectangle. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Algorithmica ![In: Algorithmica 47(3), pp. 323-342, 2007. The full citation details ...](Pics/full.jpeg) |
2007 |
DBLP DOI BibTeX RDF |
|
52 | Toshihide Ibaraki, Kouji Nakamura |
Packing Problems with Soft Rectangles. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Hybrid Metaheuristics ![In: Hybrid Metaheuristics, Third International Workshop, HM 2006, Gran Canaria, Spain, October 13-15, 2006, Proceedings, pp. 13-27, 2006, Springer, 3-540-46384-4. The full citation details ...](Pics/full.jpeg) |
2006 |
DBLP DOI BibTeX RDF |
|
52 | Edward G. Coffman Jr., Peter J. Downey, Peter M. Winkler |
Packing rectangles in a strip. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Acta Informatica ![In: Acta Informatica 38(10), pp. 673-693, 2002. The full citation details ...](Pics/full.jpeg) |
2002 |
DBLP DOI BibTeX RDF |
|
52 | Jeff Edmonds, Jarek Gryz, Dongming Liang, Renée J. Miller |
Mining for Empty Rectangles in Large Data Sets. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ICDT ![In: Database Theory - ICDT 2001, 8th International Conference, London, UK, January 4-6, 2001, Proceedings., pp. 174-188, 2001, Springer, 3-540-41456-8. The full citation details ...](Pics/full.jpeg) |
2001 |
DBLP DOI BibTeX RDF |
|
52 | Ingo Schiermeyer |
Reverse-Fit: A 2-Optimal Algorithm for Packing Rectangles. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ESA ![In: Algorithms - ESA '94, Second Annual European Symposium, Utrecht, The Netherlands, September 26-28, 1994, Proceedings, pp. 290-299, 1994, Springer, 3-540-58434-X. The full citation details ...](Pics/full.jpeg) |
1994 |
DBLP DOI BibTeX RDF |
level-oriented packing algorithm, two-dimensional packing, k-rectangle packing problem, rectangle packing conjecture, bin-packing |
52 | Marc J. van Kreveld, Mark de Berg |
Finding Squares and Rectangles in Sets of Points. ![Search on Bibsonomy](Pics/bibsonomy.png) |
WG ![In: Graph-Theoretic Concepts in Computer Science, 15th International Workshop, WG '89, Castle Rolduc, The Netherlands, June 14-16, 1989, Proceedings, pp. 341-355, 1989, Springer, 3-540-52292-1. The full citation details ...](Pics/full.jpeg) |
1989 |
DBLP DOI BibTeX RDF |
|
48 | Tobias Emrich, Hans-Peter Kriegel, Peer Kröger, Matthias Renz, Andreas Züfle |
Boosting spatial pruning: on optimal pruning of MBRs. ![Search on Bibsonomy](Pics/bibsonomy.png) |
SIGMOD Conference ![In: Proceedings of the ACM SIGMOD International Conference on Management of Data, SIGMOD 2010, Indianapolis, Indiana, USA, June 6-10, 2010, pp. 39-50, 2010, ACM, 978-1-4503-0032-2. The full citation details ...](Pics/full.jpeg) |
2010 |
DBLP DOI BibTeX RDF |
rknn, pruning, spatial, knn, rectangles |
48 | Marina L. Gavrilova |
Two Map Labeling Algorithms for GIS Applications. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ICCSA (1) ![In: Computational Science and Its Applications - ICCSA 2006, International Conference, Glasgow, UK, May 8-11, 2006, Proceedings, Part I, pp. 61-70, 2006, Springer, 3-540-34070-X. The full citation details ...](Pics/full.jpeg) |
2006 |
DBLP DOI BibTeX RDF |
map labeling for polygons with holes, polygonal area removal, sweep algorithm, set of maximum inscribed rectangles, GIS |
45 | Lars Arge, Mark de Berg, Herman J. Haverkort |
Cache-Oblivious R-Trees. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Algorithmica ![In: Algorithmica 53(1), pp. 50-68, 2009. The full citation details ...](Pics/full.jpeg) |
2009 |
DBLP DOI BibTeX RDF |
Cache-oblivious data structures, R-trees, Geometric data structures, I/O-efficiency |
45 | Ali 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](Pics/bibsonomy.png) |
RelMiCS ![In: Relations and Kleene Algebra in Computer Science, 11th International Conference on Relational Methods in Computer Science, RelMiCS 2009, and 6th International Conference on Applications of Kleene Algebra, AKA 2009, Doha, Qatar, November 1-5, 2009. Proceedings, pp. 199-210, 2009, Springer, 978-3-642-04638-4. The full citation details ...](Pics/full.jpeg) |
2009 |
DBLP DOI BibTeX RDF |
Formal Concept Analysis, Galois Connection, Minimal representation |
45 | John Augustine, Sudarshan Banerjee, Sandy Irani |
Strip packing with precedence constraints and strip packing with release times. ![Search on Bibsonomy](Pics/bibsonomy.png) |
SPAA ![In: SPAA 2006: Proceedings of the 18th Annual ACM Symposium on Parallelism in Algorithms and Architectures, Cambridge, Massachusetts, USA, July 30 - August 2, 2006, pp. 180-189, 2006, ACM, 1-59593-452-9. The full citation details ...](Pics/full.jpeg) |
2006 |
DBLP DOI BibTeX RDF |
scheduling, reconfigurable architectures, precedence constraints, release times, strip packing |
45 | Mattias Andersson 0002, Joachim Gudmundsson, Christos Levcopoulos |
Chips on Wafers. ![Search on Bibsonomy](Pics/bibsonomy.png) |
WADS ![In: Algorithms and Data Structures, 8th International Workshop, WADS 2003, Ottawa, Ontario, Canada, July 30 - August 1, 2003, Proceedings, pp. 412-423, 2003, Springer, 3-540-40545-3. The full citation details ...](Pics/full.jpeg) |
2003 |
DBLP DOI BibTeX RDF |
|
43 | Peyman Afshani, Timothy M. Chan |
Dynamic Connectivity for Axis-Parallel Rectangles. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Algorithmica ![In: Algorithmica 53(4), pp. 474-487, 2009. The full citation details ...](Pics/full.jpeg) |
2009 |
DBLP DOI BibTeX RDF |
Dynamic connectivity, Data structures, Computational geometry, Dynamic data structures |
43 | Genhong Ding, Dan Li, Leng Chen |
Solving the packing problem of rectangles with improved genetic algorithm based on statistical analysis. ![Search on Bibsonomy](Pics/bibsonomy.png) |
GEC Summit ![In: Proceedings of the first ACM/SIGEVO Summit on Genetic and Evolutionary Computation, GEC Summit 2009, Shanghai, China, June 12-14, 2009, pp. 819-822, 2009, ACM, 978-1-60558-326-6. The full citation details ...](Pics/full.jpeg) |
2009 |
DBLP DOI BibTeX RDF |
orthogonal packing, packing pattern, surplus rectangle, genetic algorithm, statistical analysis |
43 | Peyman Afshani, Timothy M. Chan |
Dynamic Connectivity for Axis-Parallel Rectangles. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ESA ![In: Algorithms - ESA 2006, 14th Annual European Symposium, Zurich, Switzerland, September 11-13, 2006, Proceedings, pp. 16-27, 2006, Springer, 3-540-38875-3. The full citation details ...](Pics/full.jpeg) |
2006 |
DBLP DOI BibTeX RDF |
|
43 | Jun-Sik Kim 0001, In-So Kweon |
Infinite Homography Estimation Using Two Arbitrary Planar Rectangles. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ACCV (2) ![In: Computer Vision - ACCV 2006, 7th Asian Conference on Computer Vision, Hyderabad, India, January 13-16, 2006, Proceedings, Part II, pp. 1-10, 2006, Springer, 3-540-31244-7. The full citation details ...](Pics/full.jpeg) |
2006 |
DBLP DOI BibTeX RDF |
|
43 | Aleksei V. Fishkin, Olga Gerber, Klaus Jansen, Roberto Solis-Oba |
Packing Weighted Rectangles into a Square. ![Search on Bibsonomy](Pics/bibsonomy.png) |
MFCS ![In: Mathematical Foundations of Computer Science 2005, 30th International Symposium, MFCS 2005, Gdansk, Poland, August 29 - September 2, 2005, Proceedings, pp. 352-363, 2005, Springer, 3-540-28702-7. The full citation details ...](Pics/full.jpeg) |
2005 |
DBLP DOI BibTeX RDF |
|
43 | Klaus Jansen, Guochuan Zhang |
Maximizing the Number of Packed Rectangles. ![Search on Bibsonomy](Pics/bibsonomy.png) |
SWAT ![In: Algorithm Theory - SWAT 2004, 9th Scandinavian Workshop on Algorithm Theory, Humlebaek, Denmark, July 8-10, 2004, Proceedings, pp. 362-371, 2004, Springer, 3-540-22339-8. The full citation details ...](Pics/full.jpeg) |
2004 |
DBLP DOI BibTeX RDF |
|
43 | Olivier Beaumont, Vincent Boudet, Fabrice Rastello, Yves Robert |
Partitioning a Square into Rectangles: NP-Completeness and Approximation Algorithms. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Algorithmica ![In: Algorithmica 34(3), pp. 217-239, 2002. The full citation details ...](Pics/full.jpeg) |
2002 |
DBLP DOI BibTeX RDF |
|
43 | Herbert Süße, Klaus Voss |
A new efficient algorithm for fitting of rectangles and squares. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ICIP (2) ![In: Proceedings of the 2001 International Conference on Image Processing, ICIP 2001, Thessaloniki, Greece, October 7-10, 2001, pp. 809-812, 2001, IEEE, 0-7803-6725-1. The full citation details ...](Pics/full.jpeg) |
2001 |
DBLP DOI BibTeX RDF |
|
43 | Kunihiko Hayashi, Michiko Inoue, Toshimitsu Masuzawa, Hideo Fujiwara |
A Layout Adjustment Problem for Disjoint Rectangles Preserving Orthogonal Order. ![Search on Bibsonomy](Pics/bibsonomy.png) |
GD ![In: Graph Drawing, 6th International Symposium, GD'98, Montréal, Canada, August 1998, Proceedings, pp. 183-197, 1998, Springer, 3-540-65473-9. The full citation details ...](Pics/full.jpeg) |
1998 |
DBLP DOI BibTeX RDF |
|
43 | Zhixiang Chen 0001, Wolfgang Maass 0001 |
On-line Learning of Rectangles. ![Search on Bibsonomy](Pics/bibsonomy.png) |
COLT ![In: Proceedings of the Fifth Annual ACM Conference on Computational Learning Theory, COLT 1992, Pittsburgh, PA, USA, July 27-29, 1992., pp. 16-28, 1992, ACM, 0-89791-497-X. The full citation details ...](Pics/full.jpeg) |
1992 |
DBLP DOI BibTeX RDF |
|
43 | R. Shantaram, John Stewart |
An algorithm to minimally decompose a rectilinear figure into rectangles (abstract only). ![Search on Bibsonomy](Pics/bibsonomy.png) |
ACM Conference on Computer Science ![In: Proceedings of the 15th ACM Annual Conference on Computer Science, St. Louis, Missouri, USA, February 16-19, 1987, pp. 361, 1987, ACM, 0-89791-218-7. The full citation details ...](Pics/full.jpeg) |
1987 |
DBLP DOI BibTeX RDF |
|
43 | Jon Louis Bentley, Thomas Ottmann |
The Complexity of Manipulating Hierarchically Defined Sets of Rectangles. ![Search on Bibsonomy](Pics/bibsonomy.png) |
MFCS ![In: Mathematical Foundations of Computer Science 1981, Strbske Pleso, Czechoslovakia, August 31 - September 4, 1981, Proceedings, pp. 1-15, 1981, Springer, 3-540-10856-4. The full citation details ...](Pics/full.jpeg) |
1981 |
DBLP DOI BibTeX RDF |
|
39 | Liane Lewin-Eytan, Joseph Naor, Ariel Orda |
Admission Control in Networks with Advance Reservations. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Algorithmica ![In: Algorithmica 40(4), pp. 293-304, 2004. The full citation details ...](Pics/full.jpeg) |
2004 |
DBLP DOI BibTeX RDF |
Line network, Axis parallel rectangles, Approximation algorithms, Independent set, Advance reservations, Local ratio |
37 | Peter Auer, Philip M. Long, Aravind Srinivasan |
Approximating Hyper-Rectangles: Learning and Pseudo-Random Sets. ![Search on Bibsonomy](Pics/bibsonomy.png) |
STOC ![In: Proceedings of the Twenty-Ninth Annual ACM Symposium on the Theory of Computing, El Paso, Texas, USA, May 4-6, 1997, pp. 314-323, 1997, ACM, 0-89791-888-6. The full citation details ...](Pics/full.jpeg) |
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 |
37 | Roy Armoni, Michael E. Saks, Avi Wigderson, Shiyu Zhou |
Discrepancy Sets and Pseudorandom Generators for Combinatorial Rectangles. ![Search on Bibsonomy](Pics/bibsonomy.png) |
FOCS ![In: 37th Annual Symposium on Foundations of Computer Science, FOCS '96, Burlington, Vermont, USA, 14-16 October, 1996, pp. 412-421, 1996, IEEE Computer Society, 0-8186-7594-2. The full citation details ...](Pics/full.jpeg) |
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 |
37 | Claire Kenyon, Richard W. Kenyon |
Tiling a Polygon with Rectangles ![Search on Bibsonomy](Pics/bibsonomy.png) |
FOCS ![In: 33rd Annual Symposium on Foundations of Computer Science, Pittsburgh, Pennsylvania, USA, 24-27 October 1992, pp. 610-619, 1992, IEEE Computer Society, 0-8186-2900-2. The full citation details ...](Pics/full.jpeg) |
1992 |
DBLP DOI BibTeX RDF |
quadratic algorithm, time complexity, geometry, tiling, polygon, linear time algorithm, rectangles |
36 | Alberto Caprara, Michele Monaci |
Bidimensional packing by bilinear programming. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Math. Program. ![In: Math. Program. 118(1), pp. 75-108, 2009. The full citation details ...](Pics/full.jpeg) |
2009 |
DBLP DOI BibTeX RDF |
Mathematics Subject Classification (2000) 52C15 |
36 | David Eppstein, Elena Mumford, Bettina Speckmann, Kevin Verbeek |
Area-universal rectangular layouts. ![Search on Bibsonomy](Pics/bibsonomy.png) |
SCG ![In: Proceedings of the 25th ACM Symposium on Computational Geometry, Aarhus, Denmark, June 8-10, 2009, pp. 267-276, 2009, ACM, 978-1-60558-501-7. The full citation details ...](Pics/full.jpeg) |
2009 |
DBLP DOI BibTeX RDF |
rectangular layouts |
36 | Alberto Caprara, Marco Locatelli 0001, Michele Monaci |
Bidimensional Packing by Bilinear Programming. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IPCO ![In: Integer Programming and Combinatorial Optimization, 11th International IPCO Conference, Berlin, Germany, June 8-10, 2005, Proceedings, pp. 377-391, 2005, Springer, 3-540-26199-0. The full citation details ...](Pics/full.jpeg) |
2005 |
DBLP DOI BibTeX RDF |
|
36 | Lars Arge, Mark de Berg, Herman J. Haverkort |
Cache-oblivious r-trees. ![Search on Bibsonomy](Pics/bibsonomy.png) |
SCG ![In: Proceedings of the 21st ACM Symposium on Computational Geometry, Pisa, Italy, June 6-8, 2005, pp. 170-179, 2005, ACM, 1-58113-991-8. The full citation details ...](Pics/full.jpeg) |
2005 |
DBLP DOI BibTeX RDF |
cache-oblivious data structures, R-trees, geometric data structures, I/O-efficiency |
36 | José R. Correa, Claire Kenyon |
Approximation schemes for multidimensional packing. ![Search on Bibsonomy](Pics/bibsonomy.png) |
SODA ![In: Proceedings of the Fifteenth Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2004, New Orleans, Louisiana, USA, January 11-14, 2004, pp. 186-195, 2004, SIAM, 0-89871-558-X. The full citation details ...](Pics/full.jpeg) |
2004 |
DBLP BibTeX RDF |
|
36 | Klaus Jansen, Guochuan Zhang |
On rectangle packing: maximizing benefits. ![Search on Bibsonomy](Pics/bibsonomy.png) |
SODA ![In: Proceedings of the Fifteenth Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2004, New Orleans, Louisiana, USA, January 11-14, 2004, pp. 204-213, 2004, SIAM, 0-89871-558-X. The full citation details ...](Pics/full.jpeg) |
2004 |
DBLP BibTeX RDF |
|
36 | Alberto Caprara, Andrea Lodi 0001, Michele Monaci |
An Approximation Scheme for the Two-Stage, Two-Dimensional Bin Packing Problem. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IPCO ![In: Integer Programming and Combinatorial Optimization, 9th International IPCO Conference, Cambridge, MA, USA, May 27-29, 2002, Proceedings, pp. 315-328, 2002, Springer, 3-540-43676-6. The full citation details ...](Pics/full.jpeg) |
2002 |
DBLP DOI BibTeX RDF |
|
36 | Norio Katayama, Shin'ichi Satoh 0001 |
The SR-tree: An Index Structure for High-Dimensional Nearest Neighbor Queries. ![Search on Bibsonomy](Pics/bibsonomy.png) |
SIGMOD Conference ![In: SIGMOD 1997, Proceedings ACM SIGMOD International Conference on Management of Data, May 13-15, 1997, Tucson, Arizona, USA., pp. 369-380, 1997, ACM Press, 978-0-89791-911-1. The full citation details ...](Pics/full.jpeg) |
1997 |
DBLP DOI BibTeX RDF |
|
34 | Ke Chen 0006, Haim Kaplan, Micha Sharir |
Online conflict-free coloring for halfplanes, congruent disks, and axis-parallel rectangles. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ACM Trans. Algorithms ![In: ACM Trans. Algorithms 5(2), pp. 16:1-16:24, 2009. The full citation details ...](Pics/full.jpeg) |
2009 |
DBLP DOI BibTeX RDF |
Conflict free coloring, online algorithms, coloring |
34 | Mathias Ortner, Xavier Descombes, Josiane Zerubia |
A Marked Point Process of Rectangles and Segments for Automatic Analysis of Digital Elevation Models. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IEEE Trans. Pattern Anal. Mach. Intell. ![In: IEEE Trans. Pattern Anal. Mach. Intell. 30(1), pp. 105-119, 2008. The full citation details ...](Pics/full.jpeg) |
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 |
34 | Hee-Kap Ahn, Sang Won Bae |
Covering a Point Set by Two Disjoint Rectangles. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ISAAC ![In: Algorithms and Computation, 19th International Symposium, ISAAC 2008, Gold Coast, Australia, December 15-17, 2008. Proceedings, pp. 728-739, 2008, Springer, 978-3-540-92181-3. The full citation details ...](Pics/full.jpeg) |
2008 |
DBLP DOI BibTeX RDF |
|
34 | Rolf Harren, Rob van Stee |
Packing Rectangles into 2OPT Bins Using Rotations. ![Search on Bibsonomy](Pics/bibsonomy.png) |
SWAT ![In: Algorithm Theory - SWAT 2008, 11th Scandinavian Workshop on Algorithm Theory, Gothenburg, Sweden, July 2-4, 2008, Proceedings, pp. 306-318, 2008, Springer, 978-3-540-69900-2. The full citation details ...](Pics/full.jpeg) |
2008 |
DBLP DOI BibTeX RDF |
absolute worst-case ratio, approximation algorithm, bin packing, rectangle packing |
34 | Yakov Nekrich |
I/O-Efficient Point Location in a Set of Rectangles. ![Search on Bibsonomy](Pics/bibsonomy.png) |
LATIN ![In: LATIN 2008: Theoretical Informatics, 8th Latin American Symposium, Búzios, Brazil, April 7-11, 2008, Proceedings, pp. 687-698, 2008, Springer, 978-3-540-78772-3. The full citation details ...](Pics/full.jpeg) |
2008 |
DBLP DOI BibTeX RDF |
|
34 | Chandan Saha 0001, Sandip Das 0001 |
Covering a Set of Points in a Plane Using Two Parallel Rectangles. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ICCTA ![In: 2007 International Conference on Computing: Theory and Applications (ICCTA 2007), 5-7 March 2007, Kolkata, India, pp. 214-218, 2007, IEEE Computer Society, 978-0-7695-2770-3. The full citation details ...](Pics/full.jpeg) |
2007 |
DBLP DOI BibTeX RDF |
|
34 | Eynat Rafalin, Diane L. Souvaine, Csaba D. Tóth |
Cuttings for Disks and Axis-Aligned Rectangles. ![Search on Bibsonomy](Pics/bibsonomy.png) |
WADS ![In: Algorithms and Data Structures, 10th International Workshop, WADS 2007, Halifax, Canada, August 15-17, 2007, Proceedings, pp. 470-482, 2007, Springer, 978-3-540-73948-7. The full citation details ...](Pics/full.jpeg) |
2007 |
DBLP DOI BibTeX RDF |
|
34 | Alp Atici, Rocco A. Servedio |
Learning Unions of omega(1)-Dimensional Rectangles. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ALT ![In: Algorithmic Learning Theory, 17th International Conference, ALT 2006, Barcelona, Spain, October 7-10, 2006, Proceedings, pp. 32-47, 2006, Springer, 3-540-46649-5. The full citation details ...](Pics/full.jpeg) |
2006 |
DBLP DOI BibTeX RDF |
|
34 | Jun-Sik Kim 0001, In-So Kweon |
Estimating Intrinsic Parameters of Cameras using Two Arbitrary Rectangles. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ICPR (1) ![In: 18th International Conference on Pattern Recognition (ICPR 2006), 20-24 August 2006, Hong Kong, China, pp. 707-710, 2006, IEEE Computer Society, 0-7695-2521-0. The full citation details ...](Pics/full.jpeg) |
2006 |
DBLP DOI BibTeX RDF |
|
34 | I-Lun Tseng, Adam Postula |
An efficient algorithm for partitioning parameterized polygons into rectangles. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ACM Great Lakes Symposium on VLSI ![In: Proceedings of the 16th ACM Great Lakes Symposium on VLSI 2006, Philadelphia, PA, USA, April 30 - May 1, 2006, pp. 366-371, 2006, ACM, 1-59593-347-6. The full citation details ...](Pics/full.jpeg) |
2006 |
DBLP DOI BibTeX RDF |
corner stitching, parameterized layouts, parameterized polygons, polygon decomposition |
34 | Eric Rémila |
Tiling a Polygon with Two Kinds of Rectangles. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Discret. Comput. Geom. ![In: Discret. Comput. Geom. 34(2), pp. 313-330, 2005. The full citation details ...](Pics/full.jpeg) |
2005 |
DBLP DOI BibTeX RDF |
|
34 | Eric Rémila |
Tiling a Polygon with Two Kinds of Rectangles. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ESA ![In: Algorithms - ESA 2004, 12th Annual European Symposium, Bergen, Norway, September 14-17, 2004, Proceedings, pp. 568-579, 2004, Springer, 3-540-23025-4. The full citation details ...](Pics/full.jpeg) |
2004 |
DBLP DOI BibTeX RDF |
|
34 | Jarkko Kari, Cristopher Moore |
Rectangles and Squares Recognized by Two-Dimensional Automata. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Theory Is Forever ![In: Theory Is Forever, Essays Dedicated to Arto Salomaa on the Occasion of His 70th Birthday, pp. 134-144, 2004, Springer, 3-540-22393-2. The full citation details ...](Pics/full.jpeg) |
2004 |
DBLP DOI BibTeX RDF |
|
34 | Luigi Cinque, Fabio De Rosa, Fabio Lecca, Stefano Levialdi, Steven L. Tanimoto |
Image Retrieval Using Resegmentation Driven by Query Rectangles. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ICPR (4) ![In: 16th International Conference on Pattern Recognition, ICPR 2002, Quebec, Canada, August 11-15, 2002., pp. 142-145, 2002, IEEE Computer Society, 0-7695-1695-5. The full citation details ...](Pics/full.jpeg) |
2002 |
DBLP DOI BibTeX RDF |
|
34 | San-Yuan Wu, Sartaj Sahni |
Covering rectilinear polygons by rectangles. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IEEE Trans. Comput. Aided Des. Integr. Circuits Syst. ![In: IEEE Trans. Comput. Aided Des. Integr. Circuits Syst. 9(4), pp. 377-388, 1990. The full citation details ...](Pics/full.jpeg) |
1990 |
DBLP DOI BibTeX RDF |
|
34 | Norbert Beckmann, Hans-Peter Kriegel, Ralf Schneider, Bernhard Seeger |
The R*-Tree: An Efficient and Robust Access Method for Points and Rectangles. ![Search on Bibsonomy](Pics/bibsonomy.png) |
SIGMOD Conference ![In: Proceedings of the 1990 ACM SIGMOD International Conference on Management of Data, Atlantic City, NJ, USA, May 23-25, 1990., pp. 322-331, 1990, ACM Press, 978-0-89791-365-2. The full citation details ...](Pics/full.jpeg) |
1990 |
DBLP DOI BibTeX RDF |
|
34 | Jiahuang Ji, Menkae Jeng |
Bin-packing adjustable rectangles and applications to task scheduling on partitionable parallel computers. ![Search on Bibsonomy](Pics/bibsonomy.png) |
SPDP ![In: Proceedings of the Second IEEE Symposium on Parallel and Distributed Processing, SPDP 1990, Dallas, Texas, USA, December 9-13, 1990., pp. 312-315, 1990, IEEE Computer Society, 0-8186-2087-0. The full citation details ...](Pics/full.jpeg) |
1990 |
DBLP DOI BibTeX RDF |
|
34 | Otfried Schwarzkopf, Ulrich Fuchs 0001, Günter Rote, Emo Welzl |
Approximation of Convex Figures by Pairs of Rectangles. ![Search on Bibsonomy](Pics/bibsonomy.png) |
STACS ![In: STACS 90, 7th Annual Symposium on Theoretical Aspects of Computer Science, Rouen, France, February 22-24, 1990, Proceedings, pp. 240-249, 1990, Springer, 3-540-52282-4. The full citation details ...](Pics/full.jpeg) |
1990 |
DBLP DOI BibTeX RDF |
|
34 | Subhas C. Nandy, Bhargab B. Bhattacharya, Sibabrata Ray |
Efficient algorithms for Identifying All Maximal Isothetic Empty Rectangles in VLSI Layout Design. ![Search on Bibsonomy](Pics/bibsonomy.png) |
FSTTCS ![In: Foundations of Software Technology and Theoretical Computer Science, Tenth Conference, Bangalore, India, December 17-19, 1990, Proceedings, pp. 255-269, 1990, Springer, 3-540-53487-3. The full citation details ...](Pics/full.jpeg) |
1990 |
DBLP DOI BibTeX RDF |
interval trees, complexity, Computational geometry, placement, VLSI layout, geometric algorithms |
34 | Marshall W. Bern |
Hidden Surface Removal for Rectangles. ![Search on Bibsonomy](Pics/bibsonomy.png) |
SCG ![In: Proceedings of the Fourth Annual Symposium on Computational Geometry, Urbana-Champaign, IL, USA, June 6-8, 1988, pp. 183-192, 1988, ACM, 0-89791-270-5. The full citation details ...](Pics/full.jpeg) |
1988 |
DBLP DOI BibTeX RDF |
|
34 | Sching L. Lin, Jonathan Allen |
Minplex - a compactor that minimizes the bounding rectangle and individual rectangles in a layout. ![Search on Bibsonomy](Pics/bibsonomy.png) |
DAC ![In: Proceedings of the 23rd ACM/IEEE Design Automation Conference. Las Vegas, NV, USA, June, 1986., pp. 123-130, 1986, IEEE Computer Society Press. The full citation details ...](Pics/full.jpeg) |
1986 |
DBLP DOI BibTeX RDF |
|
34 | Christos Levcopoulos, Andrzej Lingas |
Covering Polygons with Minimum Number of Rectangles. ![Search on Bibsonomy](Pics/bibsonomy.png) |
STACS ![In: STACS 84, Symposium of Theoretical Aspects of Computer Science, Paris, France, 11-13 April, 1984, Proceedings, pp. 63-72, 1984, Springer, 3-540-12920-0. The full citation details ...](Pics/full.jpeg) |
1984 |
DBLP DOI BibTeX RDF |
|
32 | Gerold 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](Pics/bibsonomy.png) |
Discret. Math. Theor. Comput. Sci. ![In: Discret. Math. Theor. Comput. Sci. 25, 2023. The full citation details ...](Pics/full.jpeg) |
2023 |
DBLP DOI BibTeX RDF |
|
32 | Marco 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](Pics/bibsonomy.png) |
|
2022 |
RDF |
|
32 | Anna Adamaszek, Parinya Chalermsook, Andreas Wiese |
How to Tame Rectangles: Solving Independent Set and Coloring of Rectangles via Shrinking. ![Search on Bibsonomy](Pics/bibsonomy.png) |
APPROX-RANDOM ![In: Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques, APPROX/RANDOM 2015, August 24-26, 2015, Princeton, NJ, USA, pp. 43-60, 2015, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-939897-89-7. The full citation details ...](Pics/full.jpeg) |
2015 |
DBLP DOI BibTeX RDF |
|
32 | Radim Belohlávek, Vilém Vychodil |
Replacing full rectangles by dense rectangles: Concept lattices and attribute implications. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IRI ![In: Proceedings of the 2006 IEEE International Conference on Information Reuse and Integration, IRI - 2006: Heuristic Systems Engineering, September 16-18, 2006, Waikoloa, Hawaii, USA, pp. 117-122, 2006, IEEE Systems, Man, and Cybernetics Society. The full citation details ...](Pics/full.jpeg) |
2006 |
DBLP DOI BibTeX RDF |
|
32 | Zhixiang Chen 0001, Wolfgang Maass 0001 |
On-Line Learning of Rectangles and Unions of Rectangles. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Mach. Learn. ![In: Mach. Learn. 17(2-3), pp. 201-223, 1994. The full citation details ...](Pics/full.jpeg) |
1994 |
DBLP DOI BibTeX RDF |
|
32 | Bruno 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](Pics/bibsonomy.png) |
Workshop on Computational Geometry ![In: Computational Geometry - Methods, Algorithms and Applications, International Workshop on Computational Geometry CG'91, Bern, Switzerland, March 21-22, 1991, pp. 13-25, 1991, Springer, 3-540-54891-2. The full citation details ...](Pics/full.jpeg) |
1991 |
DBLP DOI BibTeX RDF |
|
30 | Ratko Orlandic, Byunggu Yu |
A Study of MBR-Based Spatial Access Methods: How Well They Perform in High-Dimensional Spaces. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IDEAS ![In: 2000 International Database Engineering and Applications Symposium, IDEAS 2000, September 18-20, 2000, Yokohoma, Japan, Proccedings, pp. 306-318, 2000, IEEE Computer Society, 0-7695-0789-1. The full citation details ...](Pics/full.jpeg) |
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 |
30 | Claudia I. Horta, José A. Lima |
Slicing and non-slicing, unified and rotation independent, algebraic representation of floorplans. ![Search on Bibsonomy](Pics/bibsonomy.png) |
EUROMICRO ![In: 23rd EUROMICRO Conference '97, New Frontiers of Information Technology, 1-4 September 1997, Budapest, Hungary, pp. 265-, 1997, IEEE Computer Society, 0-8186-8129-2. The full citation details ...](Pics/full.jpeg) |
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 |
30 | J. T. Mowchenko, Y. Yang |
Optimizing wiring space in slicing floorplans. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Great Lakes Symposium on VLSI ![In: 5th Great Lakes Symposium on VLSI (GLS-VLSI '95), March 16-18, 1995, The State University of New York at Buffalo, USA, pp. 54-, 1995, IEEE Computer Society, 0-8186-7035-5. The full citation details ...](Pics/full.jpeg) |
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 |
27 | Mingxi Wu, Xiuyao Song, Chris Jermaine, Sanjay Ranka, John Gums |
A LRT framework for fast spatial anomaly detection. ![Search on Bibsonomy](Pics/bibsonomy.png) |
KDD ![In: Proceedings of the 15th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, Paris, France, June 28 - July 1, 2009, pp. 887-896, 2009, ACM, 978-1-60558-495-9. The full citation details ...](Pics/full.jpeg) |
2009 |
DBLP DOI BibTeX RDF |
LRT spatial anomaly |
27 | Hsiu-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](Pics/bibsonomy.png) |
CSE (2) ![In: Proceedings of the 12th IEEE International Conference on Computational Science and Engineering, CSE 2009, Vancouver, BC, Canada, August 29-31, 2009, pp. 414-419, 2009, IEEE Computer Society, 978-1-4244-5334-4. The full citation details ...](Pics/full.jpeg) |
2009 |
DBLP DOI BibTeX RDF |
|
27 | Deshi Ye, Xin Han, Guochuan Zhang |
On-Line Multiple-Strip Packing. ![Search on Bibsonomy](Pics/bibsonomy.png) |
COCOA ![In: Combinatorial Optimization and Applications, Third International Conference, COCOA 2009, Huangshan, China, June 10-12, 2009. Proceedings, pp. 155-165, 2009, Springer, 978-3-642-02025-4. The full citation details ...](Pics/full.jpeg) |
2009 |
DBLP DOI BibTeX RDF |
many-core scheduling, approximation algorithms, Strip packing |
27 | Francis Y. L. Chin, Hing-Fung Ting, Yong Zhang 0001 |
Variable-Size Rectangle Covering. ![Search on Bibsonomy](Pics/bibsonomy.png) |
COCOA ![In: Combinatorial Optimization and Applications, Third International Conference, COCOA 2009, Huangshan, China, June 10-12, 2009. Proceedings, pp. 145-154, 2009, Springer, 978-3-642-02025-4. The full citation details ...](Pics/full.jpeg) |
2009 |
DBLP DOI BibTeX RDF |
|
27 | Toshihiko Takahashi, Ryo Fujimaki, Youhei Inoue |
A (4n - 4)-Bit Representation of a Rectangular Drawing or Floorplan. ![Search on Bibsonomy](Pics/bibsonomy.png) |
COCOON ![In: Computing and Combinatorics, 15th Annual International Conference, COCOON 2009, Niagara Falls, NY, USA, July 13-15, 2009, Proceedings, pp. 47-55, 2009, Springer, 978-3-642-02881-6. The full citation details ...](Pics/full.jpeg) |
2009 |
DBLP DOI BibTeX RDF |
|
27 | Igor Timko, Michael H. Böhlen, Johann Gamper |
Sequenced spatio-temporal aggregation in road networks. ![Search on Bibsonomy](Pics/bibsonomy.png) |
EDBT ![In: EDBT 2009, 12th International Conference on Extending Database Technology, Saint Petersburg, Russia, March 24-26, 2009, Proceedings, pp. 48-59, 2009, ACM, 978-1-60558-422-5. The full citation details ...](Pics/full.jpeg) |
2009 |
DBLP DOI BibTeX RDF |
|
27 | Guy 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](Pics/bibsonomy.png) |
ACM Trans. Algorithms ![In: ACM Trans. Algorithms 4(3), pp. 34:1-34:17, 2008. The full citation details ...](Pics/full.jpeg) |
2008 |
DBLP DOI BibTeX RDF |
capacitated covering, rectangle stabbing, Approximation algorithms, lot sizing |
27 | Branislav Micusík, Horst Wildenauer, Jana Kosecka |
Detection and matching of rectilinear structures. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CVPR ![In: 2008 IEEE Computer Society Conference on Computer Vision and Pattern Recognition (CVPR 2008), 24-26 June 2008, Anchorage, Alaska, USA, 2008, IEEE Computer Society, 978-1-4244-2242-5. The full citation details ...](Pics/full.jpeg) |
2008 |
DBLP DOI BibTeX RDF |
|
27 | Alexey L. Lastovetsky |
On Grid-based Matrix Partitioning for Heterogeneous Processors. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ISPDC ![In: 6th International Symposium on Parallel and Distributed Computing (ISPDC 2007), Hagenberg, Austria, July 5-8, 2007, pp. 383-390, 2007, IEEE Computer Society, 0-7695-2936-4. The full citation details ...](Pics/full.jpeg) |
2007 |
DBLP DOI BibTeX RDF |
|
27 | Chandan Giri, Soumojit Sarkar, Santanu Chattopadhyay |
A genetic algorithm based heuristic technique for power constrained test scheduling in core-based SOCs. ![Search on Bibsonomy](Pics/bibsonomy.png) |
VLSI-SoC ![In: IFIP VLSI-SoC 2007, IFIP WG 10.5 International Conference on Very Large Scale Integration of System-on-Chip, Atlanta, GA, USA, 15-17 October 2007, pp. 320-323, 2007, IEEE. The full citation details ...](Pics/full.jpeg) |
2007 |
DBLP DOI BibTeX RDF |
|
27 | Klaus Jansen, Roberto Solis-Oba |
New Approximability Results for 2-Dimensional Packing Problems. ![Search on Bibsonomy](Pics/bibsonomy.png) |
MFCS ![In: Mathematical Foundations of Computer Science 2007, 32nd International Symposium, MFCS 2007, Ceský Krumlov, Czech Republic, August 26-31, 2007, Proceedings, pp. 103-114, 2007, Springer, 978-3-540-74455-9. The full citation details ...](Pics/full.jpeg) |
2007 |
DBLP DOI BibTeX RDF |
|
27 | Adam L. Buchsbaum, Emden R. Gansner, Suresh Venkatasubramanian |
Directed graphs and rectangular layouts. ![Search on Bibsonomy](Pics/bibsonomy.png) |
APVIS ![In: APVIS 2007, 6th International Asia-Pacific Symposium on Visualization 2007, Sydney, Australia, 5-7 February 2007, pp. 61-64, 2007, IEEE Computer Society, 1-4244-0808-3. The full citation details ...](Pics/full.jpeg) |
2007 |
DBLP DOI BibTeX RDF |
|
27 | Chandan Giri, Soumojit Sarkar, Santanu Chattopadhyay |
Test Scheduling for Core-Based SOCs Using Genetic Algorithm Based Heuristic Approach. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ICIC (2) ![In: Advanced Intelligent Computing Theories and Applications. With Aspects of Artificial Intelligence, Third International Conference on Intelligent Computing, ICIC 2007, Qingdao, China, August 21-24, 2007, Proceedings, pp. 1032-1041, 2007, Springer, 978-3-540-74201-2. The full citation details ...](Pics/full.jpeg) |
2007 |
DBLP DOI BibTeX RDF |
wrapper design, test scheduling, test access mechanism, SOC testing |
27 | Stefan Porschen |
Optimal Parameterized Rectangular Coverings. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ICCSA (1) ![In: Computational Science and Its Applications - ICCSA 2007, International Conference, Kuala Lumpur, Malaysia, August 26-29, 2007. Proceedings, Part I, pp. 96-109, 2007, Springer, 978-3-540-74468-9. The full citation details ...](Pics/full.jpeg) |
2007 |
DBLP DOI BibTeX RDF |
parameterized rectangular covering, integer grid, dynamic programming, NP-hardness, optimization problem, exact algorithmics, closure operator |
27 | Guy Even, Dror Rawitz, Shimon Shahar |
Approximation Algorithms for Capacitated Rectangle Stabbing. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CIAC ![In: Algorithms and Complexity, 6th Italian Conference, CIAC 2006, Rome, Italy, May 29-31, 2006, Proceedings, pp. 18-29, 2006, Springer, 3-540-34375-X. The full citation details ...](Pics/full.jpeg) |
2006 |
DBLP DOI BibTeX RDF |
|
27 | Aleksei V. Fishkin, Olga Gerber, Klaus Jansen |
On Efficient Weighted Rectangle Packing with Large Resources. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ISAAC ![In: Algorithms and Computation, 16th International Symposium, ISAAC 2005, Sanya, Hainan, China, December 19-21, 2005, Proceedings, pp. 1039-1050, 2005, Springer, 3-540-30935-7. The full citation details ...](Pics/full.jpeg) |
2005 |
DBLP DOI BibTeX RDF |
approximation, resources, rectangle packing |
27 | Martha J. Kosa, Mark A. Boshart |
Treemap visualizations for CS2. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ITiCSE ![In: Proceedings of the 9th Annual SIGCSE Conference on Innovation and Technology in Computer Science Education, ITiCSE 2004, Leeds, UK, June 28-30, 2004, pp. 259, 2004, ACM, 1-58113-836-9. The full citation details ...](Pics/full.jpeg) |
2004 |
DBLP DOI BibTeX RDF |
|
27 | Stefan Porschen |
On the Time Complexity of Rectangular Covering Problems in the Discrete Plane. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ICCSA (3) ![In: Computational Science and Its Applications - ICCSA 2004, International Conference, Assisi, Italy, May 14-17, 2004, Proceedings, Part III, pp. 137-146, 2004, Springer, 3-540-22057-7. The full citation details ...](Pics/full.jpeg) |
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][ >>] |
|