From yjc at photon.poly.edu Wed Nov 1 12:48:29 2000 From: yjc at photon.poly.edu (Yi-Jen Chiang) Date: Mon Jan 9 13:40:58 2006 Subject: [DMANET] WADS 2001 Call for Papers (slightly modified version) Message-ID: This is a slightly modified version with some typos corrected. Please ignore the previous version posted about a week ago. Thanks! ------------ PRELIMINARY CALL FOR PAPERS WADS 2001 7th Workshop on Algorithms and Data Structures August 8-10, 2001 Brown University Providence, Rhode Island, USA http://www.wads.org/ Sponsored by the Center for Geometric Computing and by the Department of Computer Science at Brown University The Workshop on Algorithms and Data Structures, which alternates with the Scandinavian Workshop on Algorithm Theory, is intended as a forum for researchers in the area of design, analysis, and implementation of algorithms and data structures. We invite submissions of papers presenting original research on the theory and applications of algorithms and data structures in all areas, including combinatorics, computational biology, computational geometry, databases, graph drawing, graphics, information retrieval, information security, parallel and distributed computing. Contributors are invited to submit an extended abstract not exceeding 12 pages by February 19, 2001. Detailed submission instructions will be posted at http://www.wads.org/. The proceedings will be published in the Springer-Verlag series Lecture Notes in Computer Science. Deadlines: February 19: submission of papers April 18: notification of acceptance/rejection of papers May 9: receipt of accepted papers in camera-ready form June 20: advance registration Invited Speakers: M. J. Atallah (Purdue) F. T. Leighton (Akamai Technologies and MIT) Conference Organization: Conference Chair: R. Tamassia (Brown) Publicity Chair: Y.-J. Chiang (Polytechnic) Local Arrangements Chair: G. Shubina (Brown) Program Committee: Co-Chairs: F. Dehne (Carleton), J.-R. Sack (Carleton), R. Tamassia (Brown) PC-Members: A. Apostolico, T. Chan, B. Codenotti, G. Di Battista, S. Dolev, M. Farach-Colton, P. Fraigniaud, H. Gabow, S. Goldman, G. Gonnet, M. Goodrich, R. Grossi, M. Halldorsson, S. Khuller, R. Klein, J. Kleinberg, G. Liotta, E. Mayr, J. Mitchell, S. Naeher, T. Nishizeki, V. Prasanna, E. Puppo, J. Rolim, J. Snoeyink, I. Tollis, I. Vrt'o, D. Wagner, T. Warnow, S. Whitesides, P. Widmayer ********************************************************** * * Contributions to be spread via DMANET are submitted to * * DMANET@zpr.uni-koeln.de * * Replies to a message carried on DMANET should NOT be * addressed to DMANET but to the original sender. The * original sender, however, is invited to prepare an * update of the replies received and to communicate it * via DMANET. * * DISCRETE MATHEMATICS AND ALGORITHMS NETWORK (DMANET) * http://www.zpr.uni-koeln.de/dmanet * ********************************************************** From j.g.stell at cs.keele.ac.uk Tue Nov 14 14:22:06 2000 From: j.g.stell at cs.keele.ac.uk (John Stell) Date: Mon Jan 9 13:40:58 2006 Subject: JOB: Research in digital topology and geometry Message-ID: <3A114A8E.1C7321A0@cs.keele.ac.uk> Post-Doctoral Research Assistant: Digital Topology and Geometry Applications are invited for a Post Doctoral Research Assistant at The University of Leeds to work on an EPSRC funded project "Digital Topology and Geometry: An Axiomatic Approach, with Applications to GIS and Spatial Reasoning". This is a joint project with Imperial College, London, where the Principal Investigator is Dr Mike Smyth. The post will be based at the School of Computing, University of Leeds, where there is a well-established research group in spatial reasoning. There will be close collaboration with researchers at Imperial College, and also with the Geographic Information Systems research group at Keele University. The post is available from 1st January 2001, but it may be possible to agree a later starting date. The appointment is for a fixed term of three years. The principal aims of the project are 1. To develop an axiomatic theory of geometry that admits as models discrete spaces as well as classical continuous spaces such as Euclidean spaces. 2. To produce topological and geometric structures which can be used as the basis of computational descriptions of natural phenomena. Applications in the areas of Geographic Information Systems (GIS) spatial reasoning in artificial inteligence (AI) will be investigated. 3. To extend digital topology as used in image analysis to a theory of digital geometry. 4. To design and implement algorithms within the developed digital geometry for tasks such as convex hull and Delauny triangulation. The research assistant will work largely on the applications of the geometric theory including the development of algorithms and the evaluation of the suitablility of the theory to problems in areas such as spatial reasoning in AI, GIS and image analysis. One phase of the project will focus on applications to multi-resolution spatial data: the description of geometric structure at a variety of levels of detail. Candidates should have, or be about to complete a PhD in a relevant area of Computer Science, Mathematics, or Artificial Intelligence. Candidates are not expected to be familiar with all of the application areas mentioned above, but suitable research experience in one of the following areas would be useful: spatial reasoning, computational geometry, theory of image analysis, computer graphics, formal aspects of GIS. Applications are also welcome from candidates whose main experience has been in a relevant area of topology or geometry. Details of the formal aplication procedure will be available shortly, but anyone interested in this post should contact Dr John Stell by email: j.g.stell@cs.keele.ac.uk or by phone: 01782 584083. ------------- The compgeom mailing lists: see http://netlib.bell-labs.com/netlib/compgeom/readme.html or send mail to compgeom-request@research.bell-labs.com with the line: send readme Now archived at http://uiuc.edu/~sariel/CG/compgeom/maillist.html. From hil at iis.sinica.edu.tw Wed Nov 8 11:36:37 2000 From: hil at iis.sinica.edu.tw (Hsueh-I Lu) Date: Mon Jan 9 13:40:58 2006 Subject: ADVANCE PROGRAM OF ISAAC'00, TAIPEI, TAIWAN Message-ID: 11th Annual International Symposium on Algorithms and Computation (ISAAC'00) December 18--20, 2000 Institute of Information Science Academia Sinica Taipei, Taiwan http://www.iis.sinica.edu.tw/isaac00/ ================= Program Committee ================= Co-chair: D. T. Lee, Academia Sinica Co-chair: Shang-Hua Teng, Univ. of Illinois Helmut Alt, Free University of Berlin Nina Amenta, Univ. of Texas at Austin Gen-Huey Chen, National Taiwan Univ. Giuseppe Italiano, University of Rome Kazuo Iwama, Kyoto University Marcos Kiwi, University of Chile Jeff Erickson, University of Illinois Ming-Tat Ko, Academia Sinica Kurt Mehlhorn, Max Planck Institute Michael D. Mitzenmacher, Harvard Univ. Kunsoo Park, Seoul National University Tadao Takaoka, University of Canterbury Takeshi Tokuyama, Sendi University Peng-Jun Wan, Illinois Inst. of Technology Derick Wood, Hong Kong Univ. Sci. and Tech. ============= Invited Talks ============= (1) Voronoi-Based Systems of Coordinates and Surface Reconstruction, Jean-Daniel Boissonnat (INRIA, Unit\'e de Sophia Antipolis) (2) Essentially Every Unimodular Matrix Defines an Expander, Jin-Yi Cai (State University of New York at Buffalo, University of Wisconsin) =============== ADVANCE PROGRAM =============== ------------------- Monday, December 18 ------------------- [9:00--10:00] Invited Talk (1) ------------------------------ [10:30--12:00] 1A: Algorithms and Data Structures ------------------------------------------------- Strategies for Hotlink Assignments (P. Bose, J. Czyzowicz, L. Gasieniec, E. Kranakis, D. Krizanc, A. Pelc, M. Martin) A New Competitive Analysis of Randomized Caching (C. Law and C. E. Leiserson) Online Routing in Convex Subdivisions (P. Bose, A. Brodnik, S. Carlsson, E. Demaine, R. Fleischer, A. Lopez-Ortiz, P. Morin, J. Munro) [12:30--12:00] 1B: Combinatorial Optimization --------------------------------------------- A Simple Linear-Time Approximation Algorithm for Multi-processor Job Scheduling on Four Processors (J. Huang, J. Chen, S. Chen) Classification of Various Neighborhood Operations for the Nurse Scheduling Problem (T. Osogami, H. Imai) Optimal Bid Sequences for Multiple-Object Auctions with Unequal Budgets (Y. Chen, M.-Y. Kao, H.-I. Lu) [2:30--3:30] 2A: Algorithms and Data Structures ----------------------------------------------- Coping with Delays and Time-Outs in Binary Search Procedures (F. Cicalese, U. Vaccaro) Some Formal Analysis of Rocchio's Similarity-Based Relevance Feedback Algorithm (Z. Chen, B. Zhu) Reasoning with Ordered Binary Decision Diagrams (T. Horiyama, T. Ibaraki) [2:30--3:30] 2B: Approximation and Randomized Algorithms -------------------------------------------------------- On Approximating Minimum Vertex Cover for Graphs with Perfect Matching (J. Chen, I. A. Kanj) 2-Approximation Algorithm for Path Coloring on Trees of Rings (X. Deng, G. Li, W. Zang, Y. Zhou) An Approximate Algorithm for the Weighted Hamiltonian Path Completion Problem on a Tree (Q. S. Wu, C. L. Lu, R. C. T. Lee) [4:00--5:30] 3A: Algorithms and Data Structures ----------------------------------------------- Finding Independent Spanning Trees in Partial $k$-Trees (X. Zhou, T. Nishizeki) On Efficient Fixed Parameter Algorithms for Weighted Vertex Cover (R. Niedermeier, P. Rossmanith) Constructive Linear-Time Algorithms for Small Cutwidth and Carving-Width (D. M. Thilikos, M. J. Serna, H. L. Bodlaender) [4:00--5:30] 3B: Approximation and Randomized Algorithms --------------------------------------------------------- Approximation Algorithms for the Maximum Power Consumption Problem on Combinatorial Circuits (T. Asano, M. M. Halld\'orsson, K. Iwama, T. Matsuda ) A Simple and Quick Approximation Algorithm for Traveling Salesman Problem in the Plane (N. Kubo, K. Muramoto, S. Shimozono) Simple Algorithms for a Weighted Interval Selection Problem (T. Erlebach, F. C.R. Spieksma) -------------------- Tuesday, December 19 -------------------- [9:00-10:00] Invited Talk (2) ----------------------------- [10:30--12:00] 4A: Graph Drawing and Algorithms ----------------------------------------------- Efficient Minus and Signed Domination in Graphs (C. L. Lu, S.-L. Peng, C. Y. Tang) Convex Grid Drawings of Four-Connected Plane Graphs (K. Miura, S.-i. Nakano, T. Nishizeki) An Algorithm for Finding Three-Dimensional Symmetry in Series-Parallel Digraphs (S.-H. Hong, P. Eades) [10:30--12:00] 4B: Automata, Cryptography, and Complexity Theory ---------------------------------------------------------------- Undecidability Results for Monoids with Linear-Time Decidable Word Problems (M. Katsura, Y. Kobayashi, F. Otto) Secret Key Exchange Using Random Deals of Cards on Hierarchical Structures (R. Yoshikawa, S. Guo, K. Motegi, Y. Igarashi) Derandomizing Arthur-Merlin Games under Uniform Assumptions (C.-J. Lu) [2:00--3:30] 5A: Algorithms and Data Structures ----------------------------------------------- A Near Optimal Algorithm for Vertex Connectivity Augmentation (B. Jackson, T. Jordan) Simultaneous Augmentation of Two Graphs to an $\ell$-Edge-Connected Graph and a Biconnected Graph (T. Ishii, H. Nagamochi) Location Problems Based on Node-Connectivity and Edge-Connectivity between Nodes and Node-Subsets (H. Ito, M. Ito, Y. Itatsu, H. Uehara, M. Yokoyama) [2:00--3:30] 5B: Parallel and Distributed Algorithms ---------------------------------------------------- An Intuitive and Effective New Representation for Interconnection Network Structures (J. Chen, W. Jia, L. Liu, S. Chen) Randomized Leader Election Protocols in Radio Networks with no Collision Detection (K. Nakano, S. Olariu) Deterministic Broadcasting Time with Partial Knowledge of the Network (G. De~Marco, A. Pelc) [4:00-5:30] 6A: Algorithms and Data Structures ---------------------------------------------- Minimizing Makespan in Batch Machine Scheduling (C. K. Poon, P. Zhang) Preemptive Parallel Task Scheduling in $O(n)+\mboxpoly(m)$ Time (K. Jansen, L. Porkolab) Compressed Text Databases with Efficient Query Algorithms based on the Comressed Suffix Array (K. Sadakane) [4:00-5:30] 6B: Computational Geometry -------------------------------------- A Better Lower Bound for Two-Circle Point Labeling (A. Wolff, M. Thon, Y. Xu) Voronoi Diagram of a Circle Set Constructed from Voronoi Diagram of a Point Set (D.-S. Kim, D. Kim, K. Sugihara) An Improved Algorithm for Subdivision Traversal without Extra Storage (P. Bose, P. Morin) ---------------------- Wednesday, December 20 ---------------------- [9:00-10:30] 7A: Algorithms and Data Structures ----------------------------------------------- Generalized H-coloring of Graphs (P. Kristiansen, J. A. Telle) Finding a Two-Core of a Tree in Linear Time (B.-F. Wang, J.-J. Lin) Unbalanced and Hierarchical Bipartite Matchings with Applications to Labeled Tree Comparsion (M.-Y. Kao, T.-W. Lam, W.-K. Sung, H.-F. Ting) [9:00-10:30] 7B: Computational Geometry --------------------------------------- Optimal Beam Penetrations in Two and Three Dimensions (D. Z. Chen, X. (S.) Hu, J. Xu) Searching a Simple Polygon by a $k$-searcher (X. Tan) Characterization of Rooms Searchable by Two Guards (S.-M. Park, J.-H. Lee, K.-Y. Chwa) [11:00--12:00] 8A: Computational Biology ---------------------------------------- Improved Phylogeny Comparisons: Non-Shared Edges, Nearest Neighbor Interchanges, and Subtree Transfers (W.-K. Hon, M.-Y. Kao, T.-W. Lam) Phylogenetic $k$-Root and Steiner $k$-Root (G.-H. Lin, P. E. Kearney, T. Jiang) [11:00--12:00] 8B: Computational Geometry ----------------------------------------- Maintenance of a Piercing Set for Intervals with Applications (M. J. Katz, F. Nielsen, M. Segal) Optimal Polygon Cover Problems and Applications (D. Z. Chen, X. (S.) Hu, X. Wu) ================== [2:00--] Excursion ================== ------------- The compgeom mailing lists: see http://netlib.bell-labs.com/netlib/compgeom/readme.html or send mail to compgeom-request@research.bell-labs.com with the line: send readme Now archived at http://uiuc.edu/~sariel/CG/compgeom/maillist.html. From sanjiva at cse.iitd.ernet.in Thu Nov 9 10:37:56 2000 From: sanjiva at cse.iitd.ernet.in (Sanjiva Prasad) Date: Mon Jan 9 13:40:58 2006 Subject: FST TCS 2000 Call for Participation Message-ID: <200011090507.KAA02873@cse.iitd.ernet.in> [ Apologies for a second message, but there were some errors in the version sent out (including a typo in the URL for registration), as well as a change of date for early registration. -- Sanjiva Prasad ] ******************************************************************* * * * Call for Participation * * * * Foundations of Software Technology * * and * * Theoretical Computer Science * * (FST TCS 2000) * * * * India International Centre * * New Delhi, India * * 13--15 December July, 2000 * * * * REGISTER AT http://www.cse.iitd.ernet.in/~fsttcs20 * * EARLY REGISTRATION DEADLINE IS November 22 * * * ******************************************************************* Invited Speakers: Peter Buneman (U Penn) Bernard Chazelle (Princeton) E. Allen Emerson (U Texas, Austin) Martin Groetschel (ZIB, Berlin) Jose Meseguer (SRI) Philip Wadler (Avaya Labs Satellite Events: Tutorial Workshop on Recent Advances in Programming Languages December 11-12, 2000 at IIT Delhi, Hauz Khas Workshop on Geometry December 16-17, 2000 at IIT Delhi, Hauz Khas FST TCS 2000 Preliminary Programme 13 December 2000 9:00-9:30 Opening 9:30-10:30 Invited Talk: E Allen Emerson Model Checking: Theory into Practice 10:30-11:00 Tea 11:00-12:30 Fast On-line/Off-line Model checking CTL Algorithms for Optimal Properties of Pushdown Systems Reinforcement of a Network Igor Walukiewicz and its Connections with Principal Partition H. Narayanan, Sachin B. Patkar On-Line Edge-Coloring A Decidable Dense with a Fixed Number of Colors Branching-time Temporal Logic Lene Monrad Favrholdt, Salvatore La Torre and Morten Nyhave Nielsen Margherita Napoli On Approximability of the Fair Equivalence Relations Independent/Connected Edge Orna Kupferman, Nir Piterman, Dominating Set Problems Moshe Vardi Toshihiro Fujito 12:30-14:00 Lunch 14:00-15:00 Invited Talk: Philip Wadler An Algebra for XML Query 15:00-15:30 Tea 15:30-17:00 Arithmetic Circuits and Combining Semantics with Polynomial Replacement Systems Non-Standard Interpreter Pierre McKenzie, Heribert Hierarchies Vollmer, Klaus W. Wagner Sergei Abramov, Robert Glueck Depth-3 Arithmetic Circuits Using Modes to Ensure for S(2,n)(X) and Extensions of Subject Reduction for Typed the Graham-Pollack Theorem Logic Programs with Subtyping Jaikumar Radhakrishnan, Pranab Jan-Georg Smaus, Francois Sen, Sundar Vishwanathan Fages, Pierre Deransart The Weak Monadic Quantifier Dynamically Ordered Alternation Hierarchy of Probabilistic Choice Logic Equational Graphs is Infinite Programming Ly Olivier Marina De Vos, Dirk Vermeir 14 December 2000 9:00-10:00 Invited Talk: Bernard Chazelle Irregularities of Distribution, Derandomization, and Complexity Theory 10:10-11:10 Coordinatized Kernels and A Complete Fragment of Catalytic Reductions: Improved Higher-Order Duration FPT Algorithms for Max Leaf $\mu$-Calculus Spanning Tree and Other Problems Dimitar P. Guelev Michael R. Fellows, Catherine McCartin, Ulrike Stege, Frances A. Rosamond Planar Graph Blocking for A Complete Axiomatisation External Searching for Timed Automata Surender Baswana, Sandeep Sen Huimin Lin and Wang Yi 11:10-11:30 Tea 11:30-12:30 Text Sparsification via . Semantic Theory for Local Maxima Heterogeneous System Design Pierluigi Cresceznzi, Alberto Rance Cleaveland, Gerald Del Lungo, Roberto Grossi, Luettgen Elena Lodi, Linda Palgi, Gianluca Rossi Approximate Swapped Matching Formal Verification of the A Amir, M Lewenstein, E. Porat Ricart-Agrawala Algorithm Ekaterina Sedletsky, Amir Pnueli, Mordechai Ben-Ari 12:30-14:00 Lunch 14:00-15:00 Invited Talk: Jose Meseguer Rewriting Logic as a Metalogical Framework 15:00-15:30 Tea 15:30-17:00 On distribution-specific A General Framework for learning with membership queries Types in Graph Rewriting versus pseudorandom generation Barbara Koenig Johannes Köbler, Wolfang Lindner $\Theta_2^p$-completeness: The Ground Congruence for A classical approach for new Chi Calculus results Yuxi Fu, Zhenrong Yang Joel Vogel, Holger Spakowski Is the Standard Proof System Inheritance in the Join for SAT P-optimal? Calculus Johannes Köbler, Jochen Messner Cedric Fournet, Cosimo Laneve, Luc Maranget Didier Remy 15 December 2000 9:00-10:00 Invited Talk: Martin Grötschel Frequency Assignment in Mobile Phone Systems 10:10-11:10 Approximation Algorithms The Fine Structure of for Bandwidth and Storage Game Lambda Models Allocation Problems under Real Pietro Di Gianantonio, Time Constraints Gianluca Franco Stefano Leonardi, Alberto Marchetti-Spaccamela, Andrea Vitaletti Dynamic Spectrum Allocation: Strong Normalisation of The Impotency of Duration Second Order Symmetric Notification Lambda-calculus Bala Kalyanasundaram, Kirk Pruhs Michel Parigot 11:10-11:30 Tea 11:30-12:30 Scheduling to minimize the Keeping Track of the Latest average completion time of Gossip in Shared Memory Systems dedicated tasks Bharat Adsul, Aranyak Mehta, Foto Afrati, Eviripidis Bampis, Milind Sohoni Aleksei V. Fishin, Klaus Jansen Claire Keyon Hunting for Functionally On Concurrent Knowledge Analogous Genes and Logical Clock Abstractions M. T. Hallett, J. Lagergren Ajay Kshemkalyani 12:30-14:00 Lunch 14:00-15:00 Invited Talk: Peter Buneman Data Provenance: Some Basic Issues 15:00-15:30 Tea 15:30-16:30 Decidable Hierarchies of Starfree Languages Christian Glasser, Heinz Schmitz Prefix languages of Church-Rosser Languages Jens R. Woinowski 16:30-17:00 Closing Organization: FST TCS 2000 is being organized by the Indian Institute of Technology, Delhi under the aegis of the Indian Association for Research in Computer Science (IARCS). -- Sanjiva Prasad Associate Professor Department of Computer Science and Engineering sanjiva@cse.iitd.ernet.in Indian Institute of Technology, Delhi (Off) +91 11 659 1294 Hauz Khas, New Delhi 110016 (Res) +91 11 659 1684 INDIA (Fax) +91 11 686 8765 http://www.cse.iitd.ernet.in/~sanjiva ------------- The compgeom mailing lists: see http://netlib.bell-labs.com/netlib/compgeom/readme.html or send mail to compgeom-request@research.bell-labs.com with the line: send readme Now archived at http://uiuc.edu/~sariel/CG/compgeom/maillist.html. From clarkson at research.bell-labs.com Tue Nov 14 18:35:51 2000 From: clarkson at research.bell-labs.com (Ken Clarkson) Date: Mon Jan 9 13:40:58 2006 Subject: List administrivia: apologies Message-ID: <200011142335.SAA3626730@nslocum.cs.bell-labs.com> Dear compgeom-announce subscriber: The list has been broken for awhile, but should be better now. I'm sorry for the long delay (in some cases past the point of relevance) of some postings to the list. The problem was the local mail system, which would occasionally send out empty messages, as you may also have noticed. Such empty messages then cause various error messages to be generated, with puzzling results for subscribers and especially for those who post to the list. Anyway, I believe it should be better now, and again, sorry. Ken Clarkson (still) maintainer of compgeom-announce ------------- The compgeom mailing lists: see http://netlib.bell-labs.com/netlib/compgeom/readme.html or send mail to compgeom-request@research.bell-labs.com with the line: send readme Now archived at http://uiuc.edu/~sariel/CG/compgeom/maillist.html. From yjc at photon.poly.edu Wed Nov 1 12:48:29 2000 From: yjc at photon.poly.edu (Yi-Jen Chiang) Date: Mon Jan 9 13:40:59 2006 Subject: WADS 2001 Call for Papers (slightly modified version) Message-ID: This is a slightly modified version with some typos corrected. Please ignore the previous version posted about a week ago. Thanks! ------------ PRELIMINARY CALL FOR PAPERS WADS 2001 7th Workshop on Algorithms and Data Structures August 8-10, 2001 Brown University Providence, Rhode Island, USA http://www.wads.org/ Sponsored by the Center for Geometric Computing and by the Department of Computer Science at Brown University The Workshop on Algorithms and Data Structures, which alternates with the Scandinavian Workshop on Algorithm Theory, is intended as a forum for researchers in the area of design, analysis, and implementation of algorithms and data structures. We invite submissions of papers presenting original research on the theory and applications of algorithms and data structures in all areas, including combinatorics, computational biology, computational geometry, databases, graph drawing, graphics, information retrieval, information security, parallel and distributed computing. Contributors are invited to submit an extended abstract not exceeding 12 pages by February 19, 2001. Detailed submission instructions will be posted at http://www.wads.org/. The proceedings will be published in the Springer-Verlag series Lecture Notes in Computer Science. Deadlines: February 19: submission of papers April 18: notification of acceptance/rejection of papers May 9: receipt of accepted papers in camera-ready form June 20: advance registration Invited Speakers: M. J. Atallah (Purdue) F. T. Leighton (Akamai Technologies and MIT) Conference Organization: Conference Chair: R. Tamassia (Brown) Publicity Chair: Y.-J. Chiang (Polytechnic) Local Arrangements Chair: G. Shubina (Brown) Program Committee: Co-Chairs: F. Dehne (Carleton), J.-R. Sack (Carleton), R. Tamassia (Brown) PC-Members: A. Apostolico, T. Chan, B. Codenotti, G. Di Battista, S. Dolev, M. Farach-Colton, P. Fraigniaud, H. Gabow, S. Goldman, G. Gonnet, M. Goodrich, R. Grossi, M. Halldorsson, S. Khuller, R. Klein, J. Kleinberg, G. Liotta, E. Mayr, J. Mitchell, S. Naeher, T. Nishizeki, V. Prasanna, E. Puppo, J. Rolim, J. Snoeyink, I. Tollis, I. Vrt'o, D. Wagner, T. Warnow, S. Whitesides, P. Widmayer ------------- The compgeom mailing lists: see http://netlib.bell-labs.com/netlib/compgeom/readme.html or send mail to compgeom-request@research.bell-labs.com with the line: send readme Now archived at http://uiuc.edu/~sariel/CG/compgeom/maillist.html. From cterlapu at cse.unl.edu Fri Nov 10 00:50:05 2000 From: cterlapu at cse.unl.edu (Chakravarthy Terlapu) Date: Mon Jan 9 13:40:59 2006 Subject: minimum bounding box for a convex polygon Message-ID: Hi, I am a graduate student from University Of Nebraska. I am looking for drawing a minimum bounding box for a given set of points. I could draw a convex polygon from the given points, but to draw a minimum bounding box around a convex polygon seems confusing in C. Could you give me a link where I can get the code in C for drawing a minimum bounding box for a convex polygon. It would be great if you could help me with this. Thanks Chak Terlapu ------------- The compgeom mailing lists: see http://netlib.bell-labs.com/netlib/compgeom/readme.html or send mail to compgeom-request@research.bell-labs.com with the line: send readme Now archived at http://uiuc.edu/~sariel/CG/compgeom/maillist.html. From jardine at uwo.ca Wed Nov 15 14:04:38 2000 From: jardine at uwo.ca (Rick Jardine) Date: Mon Jan 9 13:40:59 2006 Subject: conference at Stanford Message-ID: <3A12DE46.26E62EF7@uwo.ca> -------------- next part -------------- First Announcement: Conference on Algebraic Topological Methods in Computer Science Department of Mathematics Stanford University July 30 - August 3, 2001 The application of algebraic topological methods in areas related to Computer Science is an emerging field that is of interest to both pure and applied mathematical scientists. The aim of this conference is to describe recent advances, and define the fundamental open problems in the field through a mixture of expository and technical lectures. There will be twenty lectures, on a variety of topics in the area. The following is a preliminary list of invited speakers: John Baez (Math, UC Riverside) Marshall Bern (Xerox PARC) Tamal Dey (CS, Ohio State) Herbert Edelsbrunner (CS, Duke) David Eppstein (CS, UC Irvine) Michael Freedman (Microsoft) Philippe Gaucher (CNRS, Strasbourg) Eric Goubault (Commissariat a l'Energie Atomique, France) Jean Goubault-Larrecq (ENS Cachan) Marco Grandis (Dip. di Mat., Genova) Jeremy Gunawardena (HP BRIMS) Joel Hass (Math Dept, UC Davis) Maurice Herlihy (CS, Brown) Reinhard Laubenbacher (NMSU) Laszlo Lovasz (Microsoft) Vaughan Pratt (CS, Stanford) Christian Reidys (Los Alamos National Lab) Bernd Sturmfels (Math Dept, UC Berkeley) Noson Yanofsky (CS, Brooklyn College) All conference announcements and information will be available at the web site: http://www.math.uwo.ca/~jardine/at-cs.html The organizers for this meeting are: Gunnar Carlsson: gunnar@math.stanford.edu Rick Jardine: jardine@uwo.ca From pollack at CIMS.NYU.EDU Wed Nov 15 16:46:22 2000 From: pollack at CIMS.NYU.EDU (Ricky Pollack) Date: Mon Jan 9 13:40:59 2006 Subject: 30th computational geometry day, friday Nov. 17 Message-ID: <200011152146.QAA01362@geometry.cims.nyu.edu> New York University Courant Institute of Mathematical Sciences THIRTIETH COMPUTATIONAL GEOMETRY DAY Friday, November 17, 2000 Room 109, Warren Weaver Hall 251 Mercer St., New York, NY 10012 0.00--10.30 Coffee (Warren Weaver Hall Lobby 10:30--11:15 Bernard Chazelle, Princeton University and NEC Research Institute The Discrepancy Method 11:30--12:15 Timothy Chan, Waterloo University On Levels in Arrangements of Curves 12:30--2:00 Lunch 2:00--3:00 Open Problem Session 3:00--3:45 Micha Sharir, Courant Institute, NYU and Tel Aviv University New Bounds for Incidences 4:00--5:00 Wine and Cheese Reception (13th floor lounge) For more information contact: Richard Pollack (212) 998-3167 pollack@geometry.nyu.edu *************************abstracts*************************************** The Discrepancy Method Bernard Chazelle Princeton University and NEC Research Institute The discrepancy method, which is the linkage between discrepancy theory and peudorandomness, has been the most powerful tool for understanding randomization as a computational resource. It has also been used for proving lower bounds in circuit complexity and communication complexity. I will review some of the milestones in the story of the discrepancy method and I will discuss what it can do and what it (probably) cannot do. On Levels in Arrangements of Curves Timothy Chan University of Waterloo We discuss a well-known problem: bounding the combinatorial complexity of the $k$-level in an arrangement of $n$ curves in the plane. Subquadratic upper bounds were known for lines (by Dey) and for graphs of quadratic functions (by Tamaki and Tokuyama). In this talk, we extend these results and give the first nontrivial bound, near $O(nk^{1-2/3^s})$, for curves that are graphs of polynomial functions of any constant degree~$s$. The proof is simple and relies on Tamaki and Tokuyama's theorem for cutting pseudo-parabolas into pseudo-segments, as well as a new observation for cutting pseudo-segments into pieces that can be extended to pseudo-lines. New Bounds for Incidences Micha Sharir Courant Institute, NYU and Tel Aviv University We present new upper bounds on the number of incidences between $m$ points and $n$ circles in the plane. The known 10-year-old bound was $O(m^{3/5}n^{4/5}+m+n)$. The new bounds are $O(m^{2/3}n^{2/3}+m)$ for $m\ge n^{3/2}$ and $O(m^{4/7}n^{17/21}+n)$ for $m\le n^{3/2}$. The proof combines Sz\'ekely's technique, which is based on crossing numbers of graphs, with Tamaki and Tokuyama's result on cutting pseudo-parabolas, and with cuttings in dual space. The talk will also review these tools and discuss several open problems and challenges suggested by the new proof. Finally, the new result of Chan, presented in this CG-Day, facilitates the extension of the analysis to obtain improved upper bounds for incidences involving points and graphs of polynomial functions of any fixed maximum degree. (Joint work with Boris Aronov.) ------------- The compgeom mailing lists: see http://netlib.bell-labs.com/netlib/compgeom/readme.html or send mail to compgeom-request@research.bell-labs.com with the line: send readme Now archived at http://uiuc.edu/~sariel/CG/compgeom/maillist.html. From rsuneeta at camden.rutgers.edu Wed Nov 15 15:51:10 2000 From: rsuneeta at camden.rutgers.edu (Suneeta Ramaswami) Date: Mon Jan 9 13:40:59 2006 Subject: Faculty positions at Rutgers University, Camden Message-ID: <200011152051.eAFKpAE01465@flamenco.rutgers.edu> The CS department at Rutgers University, Camden has faculty openings. Although we are primarily looking for applicants at the assistant professor level, we will consider applicants for senior positions as well. Please feel free to write to me with questions. - Suneeta Ramaswami ======================================================================== Rutgers University - Camden Department of Computer Science The Department of Computer Science at Rutgers University - Camden invites applications for two tenure-track positions at the assistant professor level beginning September 2001. Candidates in all areas of computer science are encouraged to apply. A Ph.D. in Computer Science is required. Salary is contingent upon qualifications. Rutgers University stands in the top 5% of AAUP rankings of university salary and benefits. Applicants should send a curriculum vitae, statement of research, statement of teaching interests/experience, and three letters of reference to: Chair, Faculty Search Committee Department of Computer Science Rutgers University Camden, NJ 08102 Review of applications will begin immediately and will continue until the positions are filled. Rutgers University is an Equal Opportunity and Affirmative Action Employer and strongly encourages applications from women and members of minority groups. ------------- The compgeom mailing lists: see http://netlib.bell-labs.com/netlib/compgeom/readme.html or send mail to compgeom-request@research.bell-labs.com with the line: send readme Now archived at http://uiuc.edu/~sariel/CG/compgeom/maillist.html. From j.winkler at dcs.shef.ac.uk Thu Nov 16 08:54:27 2000 From: j.winkler at dcs.shef.ac.uk (Joab Winkler) Date: Mon Jan 9 13:40:59 2006 Subject: Workshop on Geometric Computations Message-ID: <200011160854.IAA06677@padley.dcs.shef.ac.uk> Workshop - UNCERTAINTY IN GEOMETRIC COMPUTATIONS SHEFFIELD, UK, 4-6 JULY 2001 ------------------------------------------------ ------------------------------------------------ A workshop 'Uncertainty in Geometric Computations' will be held at The University of Sheffield, 4-6 July 2001. It is sponsored by the EPSRC and LMS (London Mathematical Society) and is of interest to researchers in pattern recognition, computer graphics and computer-aided design. The organisers are particularly keen to attract computer scientists, mathematicians and engineers in order to foster new links for collaboration. More details, including an 'indication of interest' and details of submission of a paper, are on the web page http://www.shef.ac.uk/~geom2001/ Several studentships, supported by the EPSRC, are available to eligible students. For more details, please contact the organisers : Joab Winkler (j.winkler@dcs.shef.ac.uk) Mahesan Niranjan (m.niranjan@dcs.shef.ac.uk) ______________________________________________________________ Dr Joab Winkler Professor Mahesan Niranjan Department of Computer Science The University of Sheffield 211 Portobello Street Sheffield S1 4DP United Kingdom ------------- The compgeom mailing lists: see http://netlib.bell-labs.com/netlib/compgeom/readme.html or send mail to compgeom-request@research.bell-labs.com with the line: send readme Now archived at http://uiuc.edu/~sariel/CG/compgeom/maillist.html. From mauro at seismo.berkeley.edu Wed Nov 15 15:08:40 2000 From: mauro at seismo.berkeley.edu (Mauro Casadei) Date: Mon Jan 9 13:40:59 2006 Subject: minimum bounding box for a convex polygon References: Message-ID: <009601c04f58$fe4c3f20$9c662080@berkeley.edu.berkeley.edu> That's easy: update after reading every point the Xmax,Xmin, Ymax and Ymin for your given set. After reading all your points this coordinates define your bounding box. ----- Original Message ----- From: Chakravarthy Terlapu To: Sent: Thursday, November 09, 2000 10:50 PM Subject: minimum bounding box for a convex polygon > Hi, > > I am a graduate student from University Of Nebraska. I am looking for > drawing a minimum bounding box for a given set of points. I could draw a > convex polygon from the given points, but to draw a minimum bounding box > around a convex polygon seems confusing in C. Could you give me a link > where I can get the code in C for drawing a minimum bounding box for a > convex polygon. It would be great if you could help me with this. > > Thanks > Chak Terlapu > > > > > > ------------- > The compgeom mailing lists: see > http://netlib.bell-labs.com/netlib/compgeom/readme.html > or send mail to compgeom-request@research.bell-labs.com with the line: > send readme > Now archived at http://uiuc.edu/~sariel/CG/compgeom/maillist.html. > ------------- The compgeom mailing lists: see http://netlib.bell-labs.com/netlib/compgeom/readme.html or send mail to compgeom-request@research.bell-labs.com with the line: send readme Now archived at http://uiuc.edu/~sariel/CG/compgeom/maillist.html. From phenning at lanl.gov Thu Nov 16 16:10:44 2000 From: phenning at lanl.gov (Paul Henning) Date: Mon Jan 9 13:40:59 2006 Subject: minimum bounding box for a convex polygon References: <35C5DD9F60FED21192B00004ACA6E6C7FFF959@nrclonex1.imti.nrc.ca> Message-ID: <3A146973.76D0D59D@lanl.gov> It should be noted that Gottschalk's algorithm produces an _approximate_ minimum bounding box. Unfortunately, it will bound a polygon like [(1,0),(0,1),(-1,0),(0,-1)] by an axis-aligned box, which is not a great bound. All that being said, I haven't found a better approach for 3-D. O'Rourke has an algorithm in: @Article{orourke, author = {O'Rourke, Joseph}, title = {Finding Minimal Enclosing Boxes}, journal = {International Journal of Computer and Information Sciences}, year = 1985, volume = 14, number = 3, pages = {183--199}, } for true minimal boxes, but it is a bit tricky to implement. Paul "Dickinson, John" wrote: > If you want an axis-orientated bounding box that will work and is very easy > to do. If not then search for orientated bounding box algorithms on the > net. S. Gottschalk implemented a 3D orientated bounding box algorithm see > the following paper. and his site: http://www.cs.unc.edu/~geom/OBB/OBBT.html > > OBB-Tree: A Hierarchical Structure for Rapid Interference Detection , S. > Gottschalk, M. C. Lin and D. Manocha (27 pages PostScript, ) 493K, Technical > report TR96-013, Department of Computer Science, University of N. Carolina, > Chapel Hill. Proc. of ACM Siggraph'96. > > John ------------- The compgeom mailing lists: see http://netlib.bell-labs.com/netlib/compgeom/readme.html or send mail to compgeom-request@research.bell-labs.com with the line: send readme Now archived at http://uiuc.edu/~sariel/CG/compgeom/maillist.html. From cterlapu at cse.unl.edu Thu Nov 16 14:36:39 2000 From: cterlapu at cse.unl.edu (Chakravarthy Terlapu) Date: Mon Jan 9 13:40:59 2006 Subject: breaking a huge tiff image Message-ID: Hi, I have a huge tiff image, the image info is as follows: Format: TIFF, 8-bit, pallette format (216633880 bytes) Resolution : 13227 * 16378 Cropping : Expansion: 4.6874% * 4.6892% (620*768) Selection: Colors: Got all 250 colors I need to break this huge image into chips of size 3000*3000. Could anyone tell me which tool I could use in Linux to do this. when i try to open the image in Linux using GIMP, it closes. I tried to break them using Adobe photoshop, but when i try to open using XV it shows errors like: Warning : incorrect count for field "MinSampleValue (1, expecting 3)" tag ignored Warning: unknow field with tag 34765 ignored Since this is a color image I needed to run a program that converts it to black and white image. But when i run the program and view the output I get a blurred image. This program has run successfullly on many other color tiff images. It would be great if anyone could help me. Thanks in advance Chak Terlapu ------------- The compgeom mailing lists: see http://netlib.bell-labs.com/netlib/compgeom/readme.html or send mail to compgeom-request@research.bell-labs.com with the line: send readme Now archived at http://uiuc.edu/~sariel/CG/compgeom/maillist.html. From John.Dickinson at nrc.ca Thu Nov 16 15:29:17 2000 From: John.Dickinson at nrc.ca (Dickinson, John) Date: Mon Jan 9 13:40:59 2006 Subject: minimum bounding box for a convex polygon Message-ID: <35C5DD9F60FED21192B00004ACA6E6C7FFF959@nrclonex1.imti.nrc.ca> If you want an axis-orientated bounding box that will work and is very easy to do. If not then search for orientated bounding box algorithms on the net. S. Gottschalk implemented a 3D orientated bounding box algorithm see the following paper. and his site: http://www.cs.unc.edu/~geom/OBB/OBBT.html OBB-Tree: A Hierarchical Structure for Rapid Interference Detection , S. Gottschalk, M. C. Lin and D. Manocha (27 pages PostScript, ) 493K, Technical report TR96-013, Department of Computer Science, University of N. Carolina, Chapel Hill. Proc. of ACM Siggraph'96. John -----Original Message----- From: Mauro Casadei [mailto:mauro@seismo.berkeley.edu] Sent: November 15, 2000 6:09 PM To: compgeom-discuss@research.bell-labs.com; cterlapu@cse.unl.edu Subject: Re: minimum bounding box for a convex polygon That's easy: update after reading every point the Xmax,Xmin, Ymax and Ymin for your given set. After reading all your points this coordinates define your bounding box. ----- Original Message ----- From: Chakravarthy Terlapu To: Sent: Thursday, November 09, 2000 10:50 PM Subject: minimum bounding box for a convex polygon > Hi, > > I am a graduate student from University Of Nebraska. I am looking for > drawing a minimum bounding box for a given set of points. I could draw a > convex polygon from the given points, but to draw a minimum bounding box > around a convex polygon seems confusing in C. Could you give me a link > where I can get the code in C for drawing a minimum bounding box for a > convex polygon. It would be great if you could help me with this. > > Thanks > Chak Terlapu > > > > > > ------------- > The compgeom mailing lists: see > http://netlib.bell-labs.com/netlib/compgeom/readme.html > or send mail to compgeom-request@research.bell-labs.com with the line: > send readme > Now archived at http://uiuc.edu/~sariel/CG/compgeom/maillist.html. > ------------- The compgeom mailing lists: see http://netlib.bell-labs.com/netlib/compgeom/readme.html or send mail to compgeom-request@research.bell-labs.com with the line: send readme Now archived at http://uiuc.edu/~sariel/CG/compgeom/maillist.html. ------------- The compgeom mailing lists: see http://netlib.bell-labs.com/netlib/compgeom/readme.html or send mail to compgeom-request@research.bell-labs.com with the line: send readme Now archived at http://uiuc.edu/~sariel/CG/compgeom/maillist.html. From gaertner at inf.ethz.ch Fri Nov 17 10:34:57 2000 From: gaertner at inf.ethz.ch (Bernd Gaertner) Date: Mon Jan 9 13:40:59 2006 Subject: minimum bounding box for a convex polygon Message-ID: <200011170934.KAA20449@shadow.inf.ethz.ch> > I am a graduate student from University Of Nebraska. I am looking for > drawing a minimum bounding box for a given set of points. I could draw a > convex polygon from the given points, but to draw a minimum bounding box > around a convex polygon seems confusing in C. If you are talking about a point set in the plane, there is C++ code for it in the CGAL library, see www.cgal.org. The algorithm computes the smallest rectangle of any orientation that contains the point set. Best regards, Bernd. ------------- The compgeom mailing lists: see http://netlib.bell-labs.com/netlib/compgeom/readme.html or send mail to compgeom-request@research.bell-labs.com with the line: send readme Now archived at http://uiuc.edu/~sariel/CG/compgeom/maillist.html. From sariel at cs.uiuc.edu Fri Nov 17 09:57:52 2000 From: sariel at cs.uiuc.edu (Sariel Har-Peled) Date: Mon Jan 9 13:40:59 2006 Subject: minimum bounding box for a convex polygon In-Reply-To: <200011170934.KAA20449@shadow.inf.ethz.ch>; from gaertner@inf.ethz.ch on Fri, Nov 17, 2000 at 10:34:57AM +0100 References: <200011170934.KAA20449@shadow.inf.ethz.ch> Message-ID: <20001117095752.A1562@valis.cs.uiuc.edu> Hi, For arbitrarily oriented bounding box, people usually use PCA. For guaranteed approximation in 3d (in near linear time), see: @inproceedings{bh-eamvb-99, author = {G.~Barequet and S.~Har-Peled}, title = {Efficiently Approximating the Minimum-Volume Bounding Box of a Point Set in Three Dimensions}, booktitle = "Proc. 10th ACM-SIAM Sympos. Discrete Algorithms", year = 1999, pages = {82--91} } http://www.uiuc.edu/~sariel/papers/98/bbox.html For source code, see: http://www.uiuc.edu/~sariel/papers/00/diameter/diam_prog.html bye --Sariel On Fri, Nov 17, 2000 at 10:34:57AM +0100, Bernd Gaertner wrote: > > > I am a graduate student from University Of Nebraska. I am looking for > > drawing a minimum bounding box for a given set of points. I could draw a > > convex polygon from the given points, but to draw a minimum bounding box > > around a convex polygon seems confusing in C. > > If you are talking about a point set in the plane, there is C++ code for it > in the CGAL library, see www.cgal.org. The algorithm computes the smallest > rectangle of any orientation that contains the point set. > > Best regards, > Bernd. > > ------------- > The compgeom mailing lists: see > http://netlib.bell-labs.com/netlib/compgeom/readme.html > or send mail to compgeom-request@research.bell-labs.com with the line: > send readme > Now archived at http://uiuc.edu/~sariel/CG/compgeom/maillist.html. -- Sariel Har-Peled, CS Dept, UIUC, Urbana, IL, 61801-2987 ------------- The compgeom mailing lists: see http://netlib.bell-labs.com/netlib/compgeom/readme.html or send mail to compgeom-request@research.bell-labs.com with the line: send readme Now archived at http://uiuc.edu/~sariel/CG/compgeom/maillist.html. From dls at eecs.tufts.edu Fri Nov 17 08:24:41 2000 From: dls at eecs.tufts.edu (Diane Souvaine) Date: Mon Jan 9 13:40:59 2006 Subject: ACM Symposium on Computational Geometry 2001: CALL FOR PAPERS Message-ID: <200011171324.IAA16898@andante.eecs.tufts.edu> ******************************************************************************* PAPERS DUE DECEMBER 6, 2000: Electronic Submission info available on web page. ******************************************************************************* CALL FOR PAPERS Seventeenth Annual Symposium on COMPUTATIONAL GEOMETRY June 3--5, 2001 Tufts University, Medford, Massachusetts http://www.eecs.tufts.edu/EECS/scg01 Sponsored by ACM SIGACT and ACM SIGGRAPH The Seventeenth Annual Symposium on Computational Geometry, featuring an applied track, a theoretical track, and a video review, will be held at Tufts University, Medford, Massachusetts. We invite high-quality submissions in the following areas: * geometric algorithms or combinatorial geometry, for the theoretical track, OR * implementation issues or applications of computational geometry, for the applied track. The proceedings, with the papers of both tracks, will be distributed at the symposium and will subsequently be available for purchase from ACM. A selection of papers will be invited to special issues of journals. During the conference, sessions of presentations will alternate between the two tracks, rather than being in parallel. Topics for the theoretical track include, but are not limited to design and theoretical analysis of geometric algorithms and data structures; lower bounds for geometric problems; and discrete and combinatorial geometry. Topics for the applied track include, but are not limited to experimental analysis of algorithms and data structures; mathematical and numerical issues arising from implementations; and novel uses of computational geometry in other disciplines, such as robotics, computer graphics, geometric and solid modeling, manufacturing, geographical information systems, and molecular biology. Electronic submissions are preferred for the THEORETICAL TRACK but authors may instead mail 8 copies of an extended abstract to arrive by *****DECEMBER 6, 2000****** to David Eppstein Dept. of Information Computer Science, University of California, Irvine, Irvine, CA 92697-3425 USA. Phone: (949) 824-6384; Email: eppstein@ics.uci.edu Electronic submissions are preferred for the APPLIED TRACK but authors may instead mail 10 copies of an extended abstract to arrive by *****DECEMBER 6, 2000****** to Dan Halperin School of Computer Science Schreiber Building, Rm 219 Tel Aviv University Tel Aviv 69978 Israel Phone: +972-3-640-6478; Email: halperin@math.tau.ac.il IMPORTANT DATES: December 6, 2000: Papers due, both tracks February 13, 2001: Video submissions due February 15, 2001: Notification of acceptance or rejection of papers March 1, 2001: Notification of acceptance or rejection of videos March 15, 2001: Camera-ready papers due April 15, 2001: Final versions of videos due June 3--5, 2001: Symposium Papers that primarily address practical issues and implementation experience, even if not tied to a particular application domain, should be submitted to the applied track. Papers that primarily prove theorems should be submitted to the theoretical track. Most experimental work should be submitted to the applied track; an exception would be experiments in support of mathematical investigations. Submissions to one track may be forwarded to the other for consideration, unless the authors have explicitly stated interest in one track only. Papers should be submitted in the form of an extended abstract. Papers should begin with the title of the paper, each author's name, affiliation, and e-mail address, followed by a succinct statement of the problems and goals that are considered in the paper, the main results achieved, the significance of the work in the context of previous research, and a comparison to past research. The abstract should provide sufficient detail to allow the program committee to evaluate the validity, quality, and relevance of the contribution. The entire extended abstract should not exceed 10 pages, using 11 point or larger font and with at least one-inch margins all around. For cases in which the authors consider it absolutely essential to include additional technical details that do not fit into 10 pages, these details may be added in a clearly marked appendix that should appear after the body of the paper and the references; this appendix will not be regarded as a part of the submission and will be considered only at the program committee's discretion. Abstracts in hard copy must be received by December 6, 2000, or postmarked by November 29 and sent airmail. Abstracts in electronic form are due by December 6, 5:00 PM EST. These are firm deadlines: late submissions will not be considered. Authors will be notified of acceptance or rejection by February 15, 2001. A full version of each contribution in final form will be due by March 15, 2001 for inclusion in the proceedings. Theoretical Track Program Committee: Applied Track Program Committee: Boris Aronov (Polytechnic U, Brooklyn) Nancy Amato (Texas A&M ) Otfried Cheong (Utrecht U) Karl Bo"hringer (U Washington, Seattle) Jesu's De Loera (UC Davis) Franca Gianini (IMA, Genova) David Eppstein, Chair (UC Irvine) Lutz Kettner (UNC Chapel Hill) Sariel Har-Peled (UI Urbana Champaign) Dan Halperin, Chair (Tel Aviv U) Piotr Indyk (MIT) Kurt Mehlhorn (MPII, Saarbru"cken) Edgar A. Ramos (MPII Saarbru"cken) Mark Overmars (Utrecht U) Ileana Streinu (Smith College) Seth Teller (MIT) Peter Widmayer (ETH Zurich) Conference Chair: Mariette Yvinec (INRIA Sophia-Antipolis) Diane L.Souvaine (Tufts U) ******************************************************************************* ------------- The compgeom mailing lists: see http://netlib.bell-labs.com/netlib/compgeom/readme.html or send mail to compgeom-request@research.bell-labs.com with the line: send readme Now archived at http://uiuc.edu/~sariel/CG/compgeom/maillist.html. From eppstein at ics.uci.edu Mon Nov 27 21:27:34 2000 From: eppstein at ics.uci.edu (David Eppstein) Date: Mon Jan 9 13:40:59 2006 Subject: Tenured/tenure track graphics position at UC Irvine Message-ID: <12020600.3184349254@cx344290-c.irvn1.occa.home.com> University of California, Irvine Information and Computer Science The University of California, Irvine, Department of Information and Computer Science (ICS), is seeking excellent candidates for a tenured or tenure-track position in Computer Graphics. Computer Graphics is a new research area in ICS and is dedicated to grow substantially over the next few years. For more information about the graphics lab at ICS, see the web page http://www.ics.uci.edu/~graphics/. We are particularly interested in graphics for digital arts, but we are open to qualified candidates in other areas who will complement or bolster our current strengths. The position is for Associate or Assistant Professor, but exceptional candidates from all ranks are eagerly sought. We are looking for applicants with a Ph.D. degree in Computer Science or a related field and strong research credentials as evidenced by scholarly publications. Applicants for a senior position must also demonstrate a proven track record in funded research activities. The Department and UCI are poised for exceptional growth in the coming years. The ICS Department (http://www.ics.uci.edu/) is organized as an independent campus unit reporting to the Executive Vice Chancellor. It runs the largest computing program in the University of California system, and has designed an undergraduate honors program that attracts the campus' most qualified students. External funding from government and industrial sponsors exceeded $10 million last year. The Department currently has 38 full-time faculty and 200 Ph.D. students involved in various research areas including analysis of algorithms and data structures, artificial intelligence and machine learning, hardware-software co-design, parallel and distributed processing, embedded systems, communication networks, middleware technology, security and cryptography, databases, information retrieval and visualization, computational biology, computer graphics, human computer interaction and computer supported cooperative work, programming languages, software development and advanced software technology. ICS faculty are at the forefront of research in emerging areas of the computer science discipline such as multimedia/embedded computing, Internet computing and mobile systems, knowledge-discovery in databases, biomedical informatics, the role of information in computer science, and the social aspects of computing technology. The faculty has effective interdisciplinary ties to colleagues in the arts, biology, cognitive science, engineering, management, medicine, and the social sciences. Although UC Irvine is a young university, it has attained remarkable stature in the past 3 decades. Two Nobel prizes were recently awarded to UCI faculty. UCI is located three miles from the Pacific Ocean near Newport Beach, approximately forty miles south of Los Angeles. The climate is ideal year-round avoiding extreme temperatures in winters and summers. Irvine is consistently ranked among the safest cities in the U.S. and has an exceptional public school system. The campus is surrounded by high-technology companies that participate in an active affiliates program. Both the campus and the area offer exciting professional and cultural opportunities. Mortgage and housing assistance are available including newly built, for-sale housing located on campus and within short walking distance from the department. Since ICS is also recruiting applicants in other areas of computer science for additional faculty positions, applications should be accompanied by a cover letter noting that this applicant is for Area A (Graphics), thus ensuring correct routing within our bureaucracy. Applicants should send a CV, three sample papers, and contact information for three or four references to recruit@ics.uci.edu with a cc to recruit-A@ics.uci.edu (PDF, postscript, Word, or ASCII). Applicants are requested to ask their references to send letters of evaluation to recruit@ics.uci.edu by January 12, 2001. Those that insist upon sending hard copy may send it to: ICS Faculty Position [A] c/o Peggy Munhall Department of Information and Computer Science University of California, Irvine Irvine, CA 92697-3425 For more information, prospective applicants are encouraged to contact David Eppstein, Chair, ICS Faculty Position A by email at recruit-A@ics.uci.edu. Application screening will begin immediately upon receipt of curriculum vitae. Maximum consideration will be given to applications received by January 5, 2001. The University of California is an Equal Opportunity Employer, committed to excellence through diversity. -- David Eppstein UC Irvine Dept. of Information & Computer Science eppstein@ics.uci.edu http://www.ics.uci.edu/~eppstein/ ------------- The compgeom mailing lists: see http://netlib.bell-labs.com/netlib/compgeom/readme.html or send mail to compgeom-request@research.bell-labs.com with the line: send readme Now archived at http://uiuc.edu/~sariel/CG/compgeom/maillist.html. From robins at cs.virginia.edu Tue Nov 28 19:13:40 2000 From: robins at cs.virginia.edu (Gabriel Robins) Date: Mon Jan 9 13:40:59 2006 Subject: faculty job openings Message-ID: <200011290013.TAA20113@cobra.cs.Virginia.EDU> ============================================================================= FACULTY POSITIONS THE UNIVERSITY OF VIRGINIA Department of Computer Science The University of Virginia's Department of Computer Science invites applications for tenure track and tenured faculty positions. Outstanding candidates in all areas of Computer Science will be considered. Research faculty (non tenure- track) openings of all ranks are also available. The Department has a first rate experimental computer science research program and has in place an innovative undergraduate CS curriculum. We are looking for candidates who are or have the potential to become outstanding in both research and teaching. Ph.D. required. Positions will be open until filled, and salary is commensurate with experience. Our Department is a vibrant, exciting research environment. To review our Department's recent accomplishments, please see: http://www.cs.virginia.edu Send a resume and the names of three references to: Professor Jack Stankovic, Chair Department of Computer Science School of Engineering & Applied Science University of Virginia 151 Engineer's Way, P. O. Box 400740 Charlottesville, VA 22904-4740 The University of Virginia is an Equal Opportunity/Affirmative Action Employer. ============================================================================= ------------- The compgeom mailing lists: see http://netlib.bell-labs.com/netlib/compgeom/readme.html or send mail to compgeom-request@research.bell-labs.com with the line: send readme Now archived at http://uiuc.edu/~sariel/CG/compgeom/maillist.html.