Sciweavers

    COMPGEOM
    2008
    ACM
    87views Discrete Geometry» more  COMPGEOM 2008»
    Markov convexity and local rigidity of distorted metrics
    13 years 6 months ago
    Markov convexity and local rigidity of distorted metrics
    Download  www.cims.nyu.edu
    Manor Mendel, Assaf Naor
    claim paper
    Read More »
    COMPGEOM
    2008
    ACM
    106views Discrete Geometry» more  COMPGEOM 2008»
    The complexity of the outer face in arrangements of random segments
    13 years 6 months ago
    The complexity of the outer face in arrangements of random segments
    Download  www.math.tau.ac.il
    We investigate the complexity of the outer face in arrangements of line segments of a fixed length in the plane, drawn uniformly at random within a square. We derive upper bounds ...
    Noga Alon, Dan Halperin, Oren Nechushtan, Micha Sh...
    claim paper
    Read More »
    COMPGEOM
    2008
    ACM
    73views Discrete Geometry» more  COMPGEOM 2008»
    Polychromatic colorings of plane graphs
    13 years 6 months ago
    Polychromatic colorings of plane graphs
    Download  www.math.tau.ac.il
    We show that the vertices of any plane graph in which every face is of length at least g can be colored by (3g - 5)/4 colors so that every color appears in every face. This is nea...
    Noga Alon, Robert Berke, Kevin Buchin, Maike Buchi...
    claim paper
    Read More »
    COMPGEOM
    2008
    ACM
    131views Discrete Geometry» more  COMPGEOM 2008»
    Delpsc: a delaunay mesher for piecewise smooth complexes
    13 years 6 months ago
    Delpsc: a delaunay mesher for piecewise smooth complexes
    Download  www.cse.ohio-state.edu
    This video presents the working of a new algorithm/software called DelPSC that meshes piecewise smooth complexes in three dimensions with Delaunay simplices. Piecewise smooth comp...
    Tamal K. Dey, Joshua A. Levine
    claim paper
    Read More »
    COCOA
    2008
    Springer
    149views Discrete Geometry» more  COCOA 2008»
    On Recovering Syntenic Blocks from Comparative Maps
    13 years 6 months ago
    On Recovering Syntenic Blocks from Comparative Maps
    Download  www.cs.montana.edu
    A genomic map is represented by a sequence of gene markers, and a gene marker can appear in several different genomic maps, in either positive or negative form. A strip (syntenic b...
    Zhixiang Chen, Bin Fu, Minghui Jiang, Binhai Zhu
    claim paper
    Read More »
    COCOA
    2008
    Springer
    167views Discrete Geometry» more  COCOA 2008»
    Strong Formulations for 2-Node-Connected Steiner Network Problems
    13 years 6 months ago
    Strong Formulations for 2-Node-Connected Steiner Network Problems
    Download  ls11-www.cs.uni-dortmund.de
    Abstract. We consider a survivable network design problem known as the 2-NodeConnected Steiner Network Problem (2NCON): we are given a weighted undirected graph with a node partiti...
    Markus Chimani, Maria Kandyba, Ivana Ljubic, Petra...
    claim paper
    Read More »
    COCOA
    2008
    Springer
    103views Discrete Geometry» more  COCOA 2008»
    Multiple Hypernode Hitting Sets and Smallest Two-Cores with Targets
    13 years 6 months ago
    Multiple Hypernode Hitting Sets and Smallest Two-Cores with Targets
    Download  www.cse.chalmers.se
    The multiple weighted hitting set problem is to find a subset of nodes in a hypergraph that hits every hyperedge in at least m nodes. We extend the problem to a notion of hypergra...
    Peter Damaschke
    claim paper
    Read More »
    COCOA
    2008
    Springer
    343views Discrete Geometry» more  COCOA 2008»
    Algorithms and Experimental Study for the Traveling Salesman Problem of Second Order
    13 years 6 months ago
    Algorithms and Experimental Study for the Traveling Salesman Problem of Second Order
    Download  www.informatik.uni-kiel.de
    We introduce a new combinatorial optimization problem, which is a generalization of the Traveling Salesman Problem (TSP) and which we call Traveling Salesman Problem of Second Orde...
    Gerold Jäger, Paul Molitor
    claim paper
    Read More »
    COCOA
    2008
    Springer
    104views Discrete Geometry» more  COCOA 2008»
    Going Weighted: Parameterized Algorithms for Cluster Editing
    13 years 6 months ago
    Going Weighted: Parameterized Algorithms for Cluster Editing
    Download  bio.informatik.uni-jena.de
    The goal of the Cluster Editing problem is to make the fewest changes to the edge set of an input graph such that the resulting graph is a disjoint union of cliques. This problem i...
    Sebastian Böcker, Sebastian Briesemeister, Qu...
    claim paper
    Read More »
    COCOA
    2008
    Springer
    112views Discrete Geometry» more  COCOA 2008»
    Enumerating Isolated Cliques in Synthetic and Financial Networks
    13 years 6 months ago
    Enumerating Isolated Cliques in Synthetic and Financial Networks
    Download  theinf1.informatik.uni-jena.de
    Falk Hüffner, Christian Komusiewicz, Hannes M...
    claim paper
    Read More »
    « first‹ previous…67891011121314…next ›last »
    Explore & Download
    Proceedings Preprints Top 5 Ranked Papers Publications Books Software Tutorials Presentations Lectures Notes Datasets
    Productivity Tools
    International On-screen Keyboard Graphical Social Symbols OCR Text Recognition CSS3 Style Generator Web Page to PDF Web Page to Image PDF Split PDF Merge Latex Equation Editor Sci2ools
    Document Tools
    PDF to Text PDF to Postscript PDF to Thumbnails Excel to PDF Word to PDF Postscript to PDF PowerPoint to PDF Latex to Word Repair Corrupted PDF
    Image Tools
    JPG to PS JPG to PDF Extract Images from PDF Image Converter
    Sciweavers
    About Community Cookies Privacy Policy Terms of Use

    Copyright © Sciweavers LLC, 2009-2024, USA.