×

Found 214 Documents (Results 1–100)

Intersection queries for flat semi-algebraic objects in three dimensions and related problems. (English) Zbl 07849002

Goaoc, Xavier (ed.) et al., 38th international symposium on computational geometry, SoCG 2022, Berlin, Germany, June 7–10, 2022. Wadern: Schloss Dagstuhl – Leibniz-Zentrum für Informatik. LIPIcs – Leibniz Int. Proc. Inform. 224, Article 4, 14 p. (2022).
MSC:  68U05
PDFBibTeX XMLCite
Full Text: DOI arXiv

Dynamic geometric set cover and hitting set. (English) Zbl 1533.68340

Cabello, Sergio (ed.) et al., 36th international symposium on computational geometry, SoCG 2020, Zürich, Switzerland (virtual conference), June 23–26, 2020. Proceedings. Wadern: Schloss Dagstuhl – Leibniz Zentrum für Informatik. LIPIcs – Leibniz Int. Proc. Inform. 164, Article 2, 15 p. (2020).
MSC:  68U05 68P05
PDFBibTeX XMLCite
Full Text: DOI

Maintaining the union of unit discs under insertions with near-optimal overhead. (English) Zbl 07559226

Barequet, Gill (ed.) et al., 35th international symposium on computational geometry, SoCG 2019, Portland, Oregon, USA, June 18–21, 2019. Proceedings. Wadern: Schloss Dagstuhl – Leibniz-Zentrum für Informatik. LIPIcs – Leibniz Int. Proc. Inform. 129, Article 26, 15 p. (2019).
MSC:  68U05
PDFBibTeX XMLCite
Full Text: DOI arXiv

Efficient algorithms for geometric partial matching. (English) Zbl 07559206

Barequet, Gill (ed.) et al., 35th international symposium on computational geometry, SoCG 2019, Portland, Oregon, USA, June 18–21, 2019. Proceedings. Wadern: Schloss Dagstuhl – Leibniz-Zentrum für Informatik. LIPIcs – Leibniz Int. Proc. Inform. 129, Article 6, 14 p. (2019).
MSC:  68U05
PDFBibTeX XMLCite
Full Text: DOI arXiv

An efficient algorithm for generalized polynomial partitioning and its applications. (English) Zbl 07559205

Barequet, Gill (ed.) et al., 35th international symposium on computational geometry, SoCG 2019, Portland, Oregon, USA, June 18–21, 2019. Proceedings. Wadern: Schloss Dagstuhl – Leibniz-Zentrum für Informatik. LIPIcs – Leibniz Int. Proc. Inform. 129, Article 5, 14 p. (2019).
MSC:  14P10
PDFBibTeX XMLCite
Full Text: DOI

Approximate minimum-weight matching with outliers under translation. (English) Zbl 1533.68399

Hsu, Wen-Lian (ed.) et al., 29th international symposium on algorithms and computation, ISAAC 2018, December 16–19, 2018, Jiaoxi, Yilan, Taiwan. Wadern: Schloss Dagstuhl – Leibniz Zentrum für Informatik. LIPIcs – Leibniz Int. Proc. Inform. 123, Article 26, 13 p. (2018).
MSC:  68W25 68U05
PDFBibTeX XMLCite
Full Text: DOI arXiv

Union of hypercubes and 3D Minkowski sums with random sizes. (English) Zbl 1502.52020

Chatzigiannakis, Ioannis (ed.) et al., 45th international colloquium on automata, languages, and programming. ICALP 2018, Prague, Czech Republic, July 9–13, 2018. Proceedings. Wadern: Schloss Dagstuhl – Leibniz Zentrum für Informatik. LIPIcs – Leibniz Int. Proc. Inform. 107, Article 10, 15 p. (2018).
MSC:  52C45 52B10 68U05
PDFBibTeX XMLCite
Full Text: DOI

Computing shortest paths in the plane with removable obstacles. (English) Zbl 1477.68454

Eppstein, David (ed.), 16th Scandinavian symposium and workshops on algorithm theory. SWAT 2018, June 18–20, 2018, Malmö University, Malmö, Sweden. Wadern: Schloss Dagstuhl – Leibniz Zentrum für Informatik. LIPIcs – Leibniz Int. Proc. Inform. 101, Article 5, 15 p. (2018).
PDFBibTeX XMLCite
Full Text: DOI

Improved dynamic geodesic nearest neighbor searching in a simple polygon. (English) Zbl 1489.68336

Speckmann, Bettina (ed.) et al., 34th international symposium on computational geometry, SoCG 2018, June 11–14, 2018, Budapest, Hungary. Wadern: Schloss Dagstuhl – Leibniz Zentrum für Informatik. LIPIcs – Leibniz Int. Proc. Inform. 99, Article 4, 14 p. (2018).
MSC:  68U05 68P05
PDFBibTeX XMLCite
Full Text: DOI arXiv

Approximate nearest neighbor search amid higher-dimensional flats. (English) Zbl 1442.68246

Pruhs, Kirk (ed.) et al., 25th European symposium on algorithms, ESA 2017, Vienna, Austria, September 4–6, 2017. Proceedings. Wadern: Schloss Dagstuhl – Leibniz Zentrum für Informatik. LIPIcs – Leibniz Int. Proc. Inform. 87, Article 4, 13 p. (2017).
MSC:  68U05 68P05 68W05
PDFBibTeX XMLCite
Full Text: DOI

Faster algorithms for the geometric transportation problem. (English) Zbl 1432.68481

Aronov, Boris (ed.) et al., 33rd international symposium on computational geometry. SoCG 2017, Brisbane, Australia, July 4–7, 2017. Proceedings. Wadern: Schloss Dagstuhl – Leibniz Zentrum für Informatik. LIPIcs – Leibniz Int. Proc. Inform. 77, Article 7, 16 p. (2017).
PDFBibTeX XMLCite
Full Text: DOI arXiv

An efficient algorithm for computing high-quality paths amid polygonal obstacles. (English) Zbl 1411.68164

Krauthgamer, Robert (ed.), Proceedings of the 27th annual ACM-SIAM symposium on discrete algorithms, SODA 2016, Arlington, VA, USA, January 10–12, 2016. Philadelphia, PA: Society for Industrial and Applied Mathematics (SIAM); New York, NY: Association for Computing Machinery (ACM). 1179-1192 (2016).
MSC:  68U05 68W25
PDFBibTeX XMLCite
Full Text: DOI arXiv

Approximating dynamic time warping and edit distance for a pair of point sequences. (English) Zbl 1387.68226

Fekete, Sándor (ed.) et al., 32nd international symposium on computational geometry, SoCG’16, Boston, MA, USA, June 14–17, 2016. Proceedings. Wadern: Schloss Dagstuhl – Leibniz Zentrum für Informatik (ISBN 978-3-95977-009-5). LIPIcs – Leibniz International Proceedings in Informatics 51, Article 6, 16 p. (2016).
MSC:  68U05 68Q25
PDFBibTeX XMLCite
Full Text: DOI arXiv

Maintaining contour trees of dynamic terrains. (English) Zbl 1378.68145

Arge, Lars (ed.) et al., 31st international symposium on computational geometry, SoCG’15, Eindhoven, Netherlands, June 22–25, 2015. Wadern: Schloss Dagstuhl – Leibniz Zentrum für Informatik (ISBN 978-3-939897-83-5). LIPIcs – Leibniz International Proceedings in Informatics 34, 796-811 (2015).
MSC:  68U05 68P05
PDFBibTeX XMLCite
Full Text: DOI arXiv

Computing the Gromov-Hausdorff distance for metric trees. (English) Zbl 1454.68173

Elbassioni, Khaled (ed.) et al., Algorithms and computation. 26th international symposium, ISAAC 2015, Nagoya, Japan, December 9–11, 2015. Proceedings. Berlin: Springer. Lect. Notes Comput. Sci. 9472, 529-540 (2015).
PDFBibTeX XMLCite
Full Text: DOI arXiv

Near-linear algorithms for geometric hitting sets and set covers. (English) Zbl 1398.68656

Proceedings of the 30th annual symposium on computational geometry, SoCG ’14, Kyoto, Japan, June 8–11, 2014. New York, NY: Association for Computing Machinery (ACM) (ISBN 978-1-4503-2594-3). 271-279 (2014).
PDFBibTeX XMLCite
Full Text: DOI

Convex hulls under uncertainty. (English) Zbl 1370.68291

Schulz, Andreas S. (ed.) et al., Algorithms – ESA 2014. 22nd annual European symposium, Wrocław, Poland, September 8–10, 2014. Proceedings. Berlin: Springer (ISBN 978-3-662-44776-5/pbk). Lecture Notes in Computer Science 8737, 37-48 (2014).
MSC:  68U05 52B55
PDFBibTeX XMLCite
Full Text: DOI arXiv

Computing the discrete Fréchet distance in subquadratic time. (English) Zbl 1422.68233

Khanna, Sanjeev (ed.), Proceedings of the 24th annual ACM-SIAM symposium on discrete algorithms, SODA 2013, New Orleans, LA, USA, January 6–8, 2013. Philadelphia, PA: Society for Industrial and Applied Mathematics (SIAM); New York, NY: Association for Computing Machinery (ACM). 156-167 (2013).
MSC:  68U05 68Q45 68W40
PDFBibTeX XMLCite
Full Text: DOI arXiv

Union of random Minkowski sums and network vulnerability analysis. (English) Zbl 1305.68096

Proceedings of the 29th annual symposium on computational geometry, SoCG 2013, Rio de Janeiro, Brazil, June 17–20, 2013. New York, NY: Association for Computing Machinery (ACM) (ISBN 978-1-4503-2031-3). 177-186 (2013).
PDFBibTeX XMLCite
Full Text: DOI Link

I/O-efficient contour queries on terrains. (English) Zbl 1373.68184

Randall, Dana (ed.), Proceedings of the 22nd annual ACM-SIAM symposium on discrete algorithms, SODA 2011, San Francisco, CA, USA, January 23–25, 2011. Philadelphia, PA: Society for Industrial and Applied Mathematics (SIAM); New York, NY: Association for Computing Machinery (ACM). 268-284 (2011).
MSC:  68P05 68U05
PDFBibTeX XMLCite
Full Text: Link

Exploiting temporal coherence in forest dynamics simulation. (English) Zbl 1283.68339

Proceedings of the 27th annual symposium on computational geometry, SoCG 2011, Paris, France, June 13–15, 2011. New York, NY: Association for Computing Machinery (ACM) (ISBN 978-1-4503-0682-9). 77-86 (2011).
PDFBibTeX XMLCite
Full Text: DOI

Streaming algorithms for extent problems in high dimensions. (English) Zbl 1288.68253

Charikar, Moses (ed.), Proceedings of the 21st annual ACM-SIAM symposium on discrete algorithms, SODA 2010, Austin, TX, USA, January 17–19, 2010. Philadelphia, PA: Society for Industrial and Applied Mathematics (SIAM); New York, NY: Association for Computing Machinery (ACM) (ISBN 978-0-89871-698-6/CD-ROM). 1481-1489 (2010).
MSC:  68W25 68Q25 68U05
PDFBibTeX XMLCite

Computing similarity between piecewise-linear functions. (English) Zbl 1284.68574

Proceedings of the 26th annual symposium on computational geometry, SoCG 2010, Snowbird, UT, USA, June 13–16, 2010. New York, NY: Association for Computing Machinery (ACM) (ISBN 978-1-4503-0016-2). 375-383 (2010).
MSC:  68U05 68W20 68W25
PDFBibTeX XMLCite
Full Text: DOI Link

An improved algorithm for computing the volume of the union of cubes. (English) Zbl 1284.68573

Proceedings of the 26th annual symposium on computational geometry, SoCG 2010, Snowbird, UT, USA, June 13–16, 2010. New York, NY: Association for Computing Machinery (ACM) (ISBN 978-1-4503-0016-2). 230-239 (2010).
MSC:  68U05 52C45 68P05
PDFBibTeX XMLCite
Full Text: DOI

Kinetic stable Delaunay graphs. (English) Zbl 1284.68576

Proceedings of the 26th annual symposium on computational geometry, SoCG 2010, Snowbird, UT, USA, June 13–16, 2010. New York, NY: Association for Computing Machinery (ACM) (ISBN 978-1-4503-0016-2). 127-136 (2010).
MSC:  68U05 68Q25 68P05
PDFBibTeX XMLCite
Full Text: DOI arXiv

The 2-center problem in three dimensions. (English) Zbl 1284.68575

Proceedings of the 26th annual symposium on computational geometry, SoCG 2010, Snowbird, UT, USA, June 13–16, 2010. New York, NY: Association for Computing Machinery (ACM) (ISBN 978-1-4503-0016-2). 87-96 (2010).
MSC:  68U05 90B80
PDFBibTeX XMLCite
Full Text: DOI arXiv

On approximate geodesic-distance queries amid deforming point clouds. (English) Zbl 1215.68082

Chirikjian, Gregory S. (ed.) et al., Algorithmic foundations of robotics VIII. Selected contributions of the eighth international workshop on the algorithmic foundations of robotics (WAFR 2008), Guanajuato, México, December 7–9, 2008. Berlin: Springer (ISBN 978-3-642-00311-0/hbk978-3-642-00312-7/ebook). Springer Tracts in Advanced Robotics 57, 351-365 (2010).
MSC:  68P05 68U05
PDFBibTeX XMLCite
Full Text: DOI

Stability of \(\varepsilon \)-kernels. (English) Zbl 1287.68164

de Berg, Mark (ed.) et al., Algorithms – ESA 2010. 18th annual European symposium, Liverpool, UK, September 6–8, 2010. Proceedings, Part I. Berlin: Springer (ISBN 978-3-642-15774-5/pbk). Lecture Notes in Computer Science 6346, 487-499 (2010).
MSC:  68U05 68Q25
PDFBibTeX XMLCite
Full Text: DOI

Davenport-Schinzel sequences and their geometric applications. Reprint of the 1995 hardback ed. (English) Zbl 1189.68161

Cambridge: Cambridge University Press (ISBN 978-0-521-13511-5/pbk). xii, 372 p. (2010).
PDFBibTeX XMLCite

Approximate Euclidean shortest paths amid convex obstacles. (English) Zbl 1422.68234

Mathieu, Claire (ed.), Proceedings of the 20th annual ACM-SIAM symposium on discrete algorithms, SODA 2009, New York, NY, USA, January 4–6, 2009. Philadelphia, PA: Society for Industrial and Applied Mathematics (SIAM); New York, NY: Association for Computing Machinery (ACM). 283-292 (2009).
MSC:  68U05 68P05 68W40
PDFBibTeX XMLCite
Full Text: Link

Near-linear approximation algorithms for geometric hitting sets. (English) Zbl 1379.68342

Proceedings of the 25th annual symposium on computational geometry, SCG 2009, Aarhus, Denmark, June 8–10, 2009. New York, NY: Association for Computing Machinery (ACM) (ISBN 978-1-60558-501-7). 23-32 (2009).
PDFBibTeX XMLCite
Full Text: DOI

Robust shape fitting via peeling and grating coresets. Reprinted from the journal Discrete & Computational Geometry 39, No. 1-3 (2008). (English) Zbl 1171.68777

Goodman, Jacob E. (ed.) et al., Twentieth anniversary volume: Discrete and computational geometry. New York, NY: Springer (ISBN 978-0-387-87362-6/pbk). 36-56 (2009).
MSC:  68U05 68W25
PDFBibTeX XMLCite

Computing the detour and spanning ratio of paths, trees, and cycles in 2D and 3D. Reprinted from the journal Discrete & Computational Geometry 39, No. 1-3 (2008). (English) Zbl 1171.68586

Goodman, Jacob E. (ed.) et al., Twentieth anniversary volume: Discrete and computational geometry. New York, NY: Springer (ISBN 978-0-387-87362-6/pbk). 15-35 (2009).
PDFBibTeX XMLCite

Untangling triangulations through local explorations. (English) Zbl 1271.68229

Proceedings of the twenty-fourth annual symposium on computational geometry, SCG 2008, College Park, MD, USA, June 09–11, 2008. New York, NY: Association for Computing Machinery (ACM) (ISBN 978-1-60558-071-5). 288-297 (2008).
MSC:  68U05 52B55 65D17
PDFBibTeX XMLCite
Full Text: DOI

An efficient algorithm for 2D Euclidean 2-center with outliers. (English) Zbl 1158.68521

Halperin, Dan (ed.) et al., Algorithms – ESA 2008. 16th annual European symposium, Karlsruhe, Germany, September 15–17, 2008. Proceedings. Berlin: Springer (ISBN 978-3-540-87743-1/pbk). Lecture Notes in Computer Science 5193, 64-75 (2008).
MSC:  68U05
PDFBibTeX XMLCite
Full Text: DOI arXiv

Stabbing convex polygons with a segment or a polygon. (English) Zbl 1158.68520

Halperin, Dan (ed.) et al., Algorithms – ESA 2008. 16th annual European symposium, Karlsruhe, Germany, September 15–17, 2008. Proceedings. Berlin: Springer (ISBN 978-3-540-87743-1/pbk). Lecture Notes in Computer Science 5193, 52-63 (2008).
MSC:  68U05 52B55 65C05
PDFBibTeX XMLCite
Full Text: DOI

State of the union (of geometric objects). (English) Zbl 1155.52017

Goodman, Jacob E. (ed.) et al., Surveys on discrete and computational geometry. Twenty years later. AMS-IMS-SIAM summer research conference, Snowbird, UT, USA, June 18–22, 2006. Providence, RI: American Mathematical Society (AMS) (ISBN 978-0-8218-4239-3/pbk). Contemporary Mathematics 453, 9-48 (2008).
PDFBibTeX XMLCite

Embeddings of surfaces, curves, and moving points in Euclidean space. (English) Zbl 1221.51025

Proceedings of the 23rd annual symposium on computational geometry 2007, Gyeongiu, South Korea, June 6–8, 2007. New York, NY: Association for Computing Machinery (ISBN 978-1-59593-705-6). 381-389 (2007).
MSC:  51M05 65D18 68U05
PDFBibTeX XMLCite
Full Text: DOI

Computing the volume of the union of cubes. (English) Zbl 1221.68254

Proceedings of the 23rd annual symposium on computational geometry 2007, Gyeongiu, South Korea, June 6–8, 2007. New York, NY: Association for Computing Machinery (ISBN 978-1-59593-705-6). 294-301 (2007).
MSC:  68U05 05C90 65D18
PDFBibTeX XMLCite

Similar simplices in a \(d\)-dimensional point set. (English) Zbl 1218.52021

Proceedings of the 23rd annual symposium on computational geometry 2007, Gyeongiu, South Korea, June 6–8, 2007. New York, NY: Association for Computing Machinery (ISBN 978-1-59593-705-6). 232-238 (2007).
MSC:  52C35
PDFBibTeX XMLCite

A space-optimal data-stream algorithm for coresets in the plane. (English) Zbl 1209.68573

Proceedings of the 23rd annual symposium on computational geometry 2007, Gyeongiu, South Korea, June 6–8, 2007. New York, NY: Association for Computing Machinery (ISBN 978-1-59593-705-6). 1-10 (2007).
MSC:  68U05
PDFBibTeX XMLCite
Full Text: DOI

Robust shape fitting via peeling and grating coresets. (English) Zbl 1192.68723

Proceedings of the Seventeenth Annual ACM-SIAM Symposium on Discrete Algorithms, Miami, FL, January 22–24, 2006. New York, NY: Association for Computing Machinery (ACM); Philadelphia, PA: Society for Industrial and Applied Mathematics (SIAM) (ISBN 0-89871-605-5). 182-191 (2006).
MSC:  68U05
PDFBibTeX XMLCite
Full Text: DOI

I/O-efficient batched union-find and its applications to terrain analysis. (English) Zbl 1153.68572

Computational geometry (SCG’06). Proceedings of the twenty-second annual symposium on computational geometry 2006, Sedona, Arizona, USA, June, 05–07, 2006. New York, NY: Association for Computing Machinery (ISBN 1-59593-340-9). 167-176 (2006).
MSC:  68W40
PDFBibTeX XMLCite

Computing a center-transversal line. (English) Zbl 1177.68235

Arun-Kumar, S. (ed.) et al., FSTTCS 2006: Foundations of software technology and theoretical computer science. 26th international conference, Kolkata, India, December 13–15, 2006. Proceedings. Berlin: Springer (ISBN 978-3-540-49994-7/pbk). Lecture Notes in Computer Science 4337, 93-104 (2006).
MSC:  68U05 52B55
PDFBibTeX XMLCite
Full Text: DOI

Guarding a terrain by two watchtowers. (English) Zbl 1380.68375

Proceedings of the 21st annual symposium on computational geometry, SCG 2005, Pisa, Italy, June 6–8, 2005. New York, NY: Association for Computing Machinery (ACM) (ISBN 1-58113-991-8). 346-355 (2005).
MSC:  68U05 68Q25
PDFBibTeX XMLCite
Full Text: DOI Link

An optimal dynamic interval stabbing-MAX data structure? (English) Zbl 1297.68225

Proceedings of the sixteenth annual ACM-SIAM symposium on discrete algorithms, SODA 2005, Vancouver, BC, Canada, January 23–25, 2005. New York, NY: ACM Press (ISBN 0-89871-585-7). 803-812 (2005).
MSC:  68U05 68P05
PDFBibTeX XMLCite

I/O-efficient construction of constrained Delaunay triangulations. (English) Zbl 1162.68726

Brodal, Gerth Stølting (ed.) et al., Algorithms – ESA 2005. 13th annual European symposium, Palma de Mallorca, Spain, October 3–6, 2005. Proceedings. Berlin: Springer (ISBN 3-540-29118-0/pbk). Lecture Notes in Computer Science 3669, 355-366 (2005).
MSC:  68U05
PDFBibTeX XMLCite
Full Text: DOI

Extreme elevation on a 2-manifold. (English) Zbl 1377.68258

Proceedings of the 20th annual symposium on computational geometry, SCG/SoCG 2004, Brooklyn, NY, USA, June 8–11, 2004. New York, NY: Association for Computing Machinery (ACM) (ISBN 1-58113-885-7). 357-365 (2004).
MSC:  68U05 57R70 92E10
PDFBibTeX XMLCite
Full Text: DOI

Practical methods for shape fitting and kinetic data structures using core sets. (English) Zbl 1375.68173

Proceedings of the 20th annual symposium on computational geometry, SCG/SoCG 2004, Brooklyn, NY, USA, June 8–11, 2004. New York, NY: Association for Computing Machinery (ACM) (ISBN 1-58113-885-7). 263-272 (2004).
MSC:  68U05 68P05
PDFBibTeX XMLCite
Full Text: DOI Link

A near-linear constant-factor approximation for Euclidean bipartite matching? (English) Zbl 1374.68628

Proceedings of the 20th annual symposium on computational geometry, SCG/SoCG 2004, Brooklyn, NY, USA, June 8–11, 2004. New York, NY: Association for Computing Machinery (ACM) (ISBN 1-58113-885-7). 247-252 (2004).
PDFBibTeX XMLCite
Full Text: DOI

A 2D kinetic triangulation with near-quadratic topological changes. (English) Zbl 1374.68627

Proceedings of the 20th annual symposium on computational geometry, SCG/SoCG 2004, Brooklyn, NY, USA, June 8–11, 2004. New York, NY: Association for Computing Machinery (ACM) (ISBN 1-58113-885-7). 180-189 (2004).
MSC:  68U05 68P05
PDFBibTeX XMLCite
Full Text: DOI

A scalable simulator for forest dynamics. (English) Zbl 1375.92079

Proceedings of the 20th annual symposium on computational geometry, SCG/SoCG 2004, Brooklyn, NY, USA, June 8–11, 2004. New York, NY: Association for Computing Machinery (ACM) (ISBN 1-58113-885-7). 106-115 (2004).
MSC:  92D40 68U05 68U20 68W25
PDFBibTeX XMLCite
Full Text: DOI

Algorithms for center and Tverberg points. (English) Zbl 1373.68422

Proceedings of the 20th annual symposium on computational geometry, SCG/SoCG 2004, Brooklyn, NY, USA, June 8–11, 2004. New York, NY: Association for Computing Machinery (ACM) (ISBN 1-58113-885-7). 61-67 (2004).
MSC:  68U05 68Q25
PDFBibTeX XMLCite
Full Text: DOI Link

On lines avoiding unit balls in three dimensions. (English) Zbl 1373.68421

Proceedings of the 20th annual symposium on computational geometry, SCG/SoCG 2004, Brooklyn, NY, USA, June 8–11, 2004. New York, NY: Association for Computing Machinery (ACM) (ISBN 1-58113-885-7). 36-45 (2004).
MSC:  68U05
PDFBibTeX XMLCite
Full Text: DOI

Efficient algorithms for bichromatic separability. (English) Zbl 1318.68179

Proceedings of the fifteenth annual ACM-SIAM symposium on discrete algorithms, SODA 2004, New Orleans, LA, USA, January 11–13, 2004. New York, NY: Association for Computing Machinery (ACM); Philadelphia, PA: Society for Industrial and Applied Mathematics (SIAM) (ISBN 0-89871-558-X). 682-690 (2004).
MSC:  68U05 68Q25 68W05
PDFBibTeX XMLCite

Filter Results by …

Document Type

all top 5

Author

all top 5

Year of Publication

all top 3

Main Field

Biographic Reference

all top 3

Software