Topics
KarlsruhePlace
SIGLETIB: RN 4052 (85368-OR) / FIZ - Fachinformationszzentrum Karlsruhe / TIB - Technische InformationsbibliothekDEGerman
Nesta tese, estudamos vÃrios problemas de teoria dos grafos relativos à coloraÃÃo e convexidade em g...
Convex analysis is a branch of mathematics that studies convex sets, convex functions, and convex ex...
Let G = (V;E) be a graph without isolated vertices. A function f: V→[0; 1] is a total dominating fun...
SIGLECopy held by FIZ Karlsruhe; available from UB/TIB Hannover / FIZ - Fachinformationszzentrum Kar...
Connections between Euclidean convex geometry and combinatorics go back to Euler, Cauchy, Minkowski ...
SIGLECopy held by FIZ Karlsruhe; available from UB/TIB Hannover / FIZ - Fachinformationszzentrum Kar...
SIGLETIB: RN 4052(90640-OR) / FIZ - Fachinformationszzentrum Karlsruhe / TIB - Technische Informatio...
© 2017 by Taylor & Francis Group, LLC. All rights reserved. The second edition of this popular boo...
We present some complexity results concerning the problems of covering a graph with p convex sets an...
In this dissertation we present complexity results related to the hull number and the convexity numb...
Graphs, Algorithms, and Optimization is a comprehensive book that features a clear explanation of mo...
AbstractDominating concepts constitute a cornerstone in Graph Theory. Part of the efforts in the fie...
AbstractA uniform proof is given for various (known) theorems asserting the convexity of a set S of ...
© 2005 by Chapman & Hall/CRC Press. Graph theory offers a rich source of problems and techniques f...
This is a survey of algorithmic results in the theory of "discrete convex analysis" for in...
Nesta tese, estudamos vÃrios problemas de teoria dos grafos relativos à coloraÃÃo e convexidade em g...
Convex analysis is a branch of mathematics that studies convex sets, convex functions, and convex ex...
Let G = (V;E) be a graph without isolated vertices. A function f: V→[0; 1] is a total dominating fun...
SIGLECopy held by FIZ Karlsruhe; available from UB/TIB Hannover / FIZ - Fachinformationszzentrum Kar...
Connections between Euclidean convex geometry and combinatorics go back to Euler, Cauchy, Minkowski ...
SIGLECopy held by FIZ Karlsruhe; available from UB/TIB Hannover / FIZ - Fachinformationszzentrum Kar...
SIGLETIB: RN 4052(90640-OR) / FIZ - Fachinformationszzentrum Karlsruhe / TIB - Technische Informatio...
© 2017 by Taylor & Francis Group, LLC. All rights reserved. The second edition of this popular boo...
We present some complexity results concerning the problems of covering a graph with p convex sets an...
In this dissertation we present complexity results related to the hull number and the convexity numb...
Graphs, Algorithms, and Optimization is a comprehensive book that features a clear explanation of mo...
AbstractDominating concepts constitute a cornerstone in Graph Theory. Part of the efforts in the fie...
AbstractA uniform proof is given for various (known) theorems asserting the convexity of a set S of ...
© 2005 by Chapman & Hall/CRC Press. Graph theory offers a rich source of problems and techniques f...
This is a survey of algorithmic results in the theory of "discrete convex analysis" for in...
Nesta tese, estudamos vÃrios problemas de teoria dos grafos relativos à coloraÃÃo e convexidade em g...
Convex analysis is a branch of mathematics that studies convex sets, convex functions, and convex ex...
Let G = (V;E) be a graph without isolated vertices. A function f: V→[0; 1] is a total dominating fun...
Add to ORKG