Sciweavers

JGT
2016
75views more  JGT 2016»
10 years 27 days ago
Excluded Minors and the Ribbon Graphs of Knots
In this paper we consider minors of ribbon graphs (or, equivalently, cellularly embedded graphs). The theory of minors of ribbon graphs differs from that of graphs in that contrac...
Iain Moffatt
JGO
2016
58views more  JGO 2016»
10 years 27 days ago
Extracting from the relaxed for large-scale semi-continuous variable nondominated frontiers
Ralph E. Steuer, Markus Hirschberger, Kalyanmoy De...
JGO
2016
37views more  JGO 2016»
10 years 27 days ago
Constrained trace-optimization of polynomials in freely noncommuting variables
The study of matrix inequalities in a dimension-free setting is in the realm of free real algebraic geometry (RAG). In this paper we investigate constrained trace and eigenvalue op...
Igor Klep, Janez Povh
JGO
2016
53views more  JGO 2016»
10 years 27 days ago
A scalarization proximal point method for quasiconvex multiobjective minimization
In this paper we propose a scalarization proximal point method to solve multiobjective unconstrained minimization problems with locally Lipschitz and quasiconvex vector functions....
Hellena Christina Fernandes Apolinário, Eri...
40
Voted
JGAA
2016
58views more  JGAA 2016»
10 years 27 days ago
Common Unfolding of Regular Tetrahedron and Johnson-Zalgaller Solid
Yoshiaki Araki, Takashi Horiyama, Ryuhei Uehara
31
Voted
JGAA
2016
41views more  JGAA 2016»
10 years 27 days ago
Threshold Circuits Detecting Global Patterns in Two-dimensional Maps
Kei Uchizawa, Daiki Yashima, Xiao Zhou
JGAA
2016
80views more  JGAA 2016»
10 years 27 days ago
Constructive algorithms for the partial directed weighted improper coloring problem
Alain Hertz, Romain Montagné, Franço...
JGAA
2016
48views more  JGAA 2016»
10 years 27 days ago
The Impact of Communication Patterns on Distributed Self-Adjusting Binary Search Tree
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
JGAA
2016
58views more  JGAA 2016»
10 years 27 days ago
An Improved Algorithm for Parameterized Edge Dominating Set Problem
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