Sciweavers

    40
    Voted
    JGAA
    2016
    58views more  JGAA 2016»
    Common Unfolding of Regular Tetrahedron and Johnson-Zalgaller Solid
    10 years 27 days ago
    Common Unfolding of Regular Tetrahedron and Johnson-Zalgaller Solid
    Download  www.jaist.ac.jp
    Yoshiaki Araki, Takashi Horiyama, Ryuhei Uehara
    claim paper
    Read More »
    31
    Voted
    JGAA
    2016
    41views more  JGAA 2016»
    Threshold Circuits Detecting Global Patterns in Two-dimensional Maps
    10 years 27 days ago
    Threshold Circuits Detecting Global Patterns in Two-dimensional Maps
    Download  jgaa.info
    Kei Uchizawa, Daiki Yashima, Xiao Zhou
    claim paper
    Read More »
    JGAA
    2016
    40views more  JGAA 2016»
    Simultaneous Drawing of Planar Graphs with Right-Angle Crossings and Few Bends
    10 years 27 days ago
    Simultaneous Drawing of Planar Graphs with Right-Angle Crossings and Few Bends
    Download  www1.pub.informatik.uni-wuerzburg.de
    Michael A. Bekos, Thomas C. van Dijk, Philipp Kind...
    claim paper
    Read More »
    JGAA
    2016
    80views more  JGAA 2016»
    Constructive algorithms for the partial directed weighted improper coloring problem
    10 years 27 days ago
    Constructive algorithms for the partial directed weighted improper coloring problem
    Download  jgaa.info
    Alain Hertz, Romain Montagné, Franço...
    claim paper
    Read More »
    JGAA
    2016
    48views more  JGAA 2016»
    The Impact of Communication Patterns on Distributed Self-Adjusting Binary Search Tree
    10 years 27 days ago
    The Impact of Communication Patterns on Distributed Self-Adjusting Binary Search Tree
    Download  www-old.cs.uni-paderborn.de
    This paper introduces the problem of communication pattern adaption for a distributed self-adjusting binary search tree. We propose a simple local algorithm that is closely related...
    Thim Strothmann
    claim paper
    Read More »
    JGAA
    2016
    58views more  JGAA 2016»
    An Improved Algorithm for Parameterized Edge Dominating Set Problem
    10 years 27 days ago
    An Improved Algorithm for Parameterized Edge Dominating Set Problem
    Download  www.amp.i.kyoto-u.ac.jp
    An edge dominating set of a graph G = (V, E) is a subset M ⊆ E of edges such that each edge in E \M is incident to at least one edge in M. In this paper, we consider the paramete...
    Ken Iwaide, Hiroshi Nagamochi
    claim paper
    Read More »
    Explore & Download
    Proceedings Preprints Top 5 Ranked Papers Publications Books Software Tutorials Presentations Lectures Notes Datasets
    Productivity Tools
    i2PDF i2Img i2Text i2OCR i2Symbol i2Type i2Speak i2Style i2Arabic i2Bopomo Latex Equation Editor
    Sciweavers
    About Community Cookies Privacy Policy Terms of Use

    Copyright © Sciweavers LLC, 2009-2026, USA.