Result 1 to 20 of 158 total
Hardness results on the gapped consecutive-ones property problem. (English)
Discrete Appl. Math. 160, No. 18, 2760-2768 (2012).
1
Bipartite permutation graphs are reconstructible. (English)
Discrete Math. Algorithms Appl. 4, No. 3, 1250039,14p. (2012).
2
Predicting missing contacts in mobile social networks. (English)
Pervasive Mobile Comput. 8, No. 5, 698-716 (2012).
3
Efficient algorithms for network localization using cores of underlying graphs. (English)
Erlebach, Thomas (ed.) et al., Algorithms for sensor systems. 7th international symposium on algorithms for sensor systems, wireless ad hoc networks and autonomous mobile entities, ALGOSENSORS 2011, Saarbrücken, Germany, September 8‒9, 2011. Revised selected papers. Berlin: Springer (ISBN 978-3-642-28208-9/pbk). Lecture Notes in Computer Science 7111, 101-114 (2012).
4
Lexicographic products with high reconstruction numbers. (English)
Discrete Math. 312, No. 10, 1638-1645 (2012).
5
An improved algorithm for reconstructing a simple polygon from its visibility angles. (English)
Comput. Geom. 45, No. 5-6, 254-257 (2012).
6
Some notes on spectra of cographs. (English)
Ars Comb. 100, 421-434 (2011).
7
On the edge-reconstruction number of disconnected graphs. (English)
Bull. Inst. Comb. Appl. 63, 87-100 (2011).
8
3D archive system for traditional performing arts application of 3D reconstruction method using graph-cuts. (English)
Int. J. Comput. Vis. 94, No. 1, 78-88 (2011).
9
Joint multi-layer segmentation and reconstruction for free-viewpoint video applications. (English)
Int. J. Comput. Vis. 93, No. 1, 73-100 (2011).
10
GPU-friendly multi-view stereo reconstruction using surfel representation and graph cuts. (English)
Comput. Vis. Image Underst. 115, No. 5, 620-634 (2011).
11
Telling convex from reflex allows to map a polygon. (English)
Schwentick, Thomas (ed.) et al., STACS 2011. 28th international symposium on theoretical aspects of computer science, Dortmund, Germany, March 10‒12, 2011. Wadern: Schloss Dagstuhl ‒ Leibniz Zentrum für Informatik (ISBN 978-3-939897-25-5). LIPICS ‒ Leibniz International Proceedings in Informatics 9, 153-164, electronic only (2011).
12
Jet reconstruction of individual orbits in many-particle problems. (English)
Pop, Horia F. (ed.) et al., 8th joint conference on mathematics and computer science, MaCS 2010, Komárno, Slovakia, July 14‒17, 2010. Selected papers. Győr: NOVADAT (ISBN 978-963-9056-38-1/pbk). 123-138 (2011).
13
Tetrahedral meshing of volumetric medical images respecting image edges. (English)
Real, Pedro (ed.) et al., Computer analysis of images and patterns. 14th international conference, CAIP 2011, Seville, Spain, August 29‒31, 2011. Proceedings, Part I. Berlin: Springer (ISBN 978-3-642-23671-6/pbk). Lecture Notes in Computer Science 6854, 161-169 (2011).
14
A computational method for bounding the probability of reconstruction on trees. (English)
SIAM J. Discrete Math. 25, No. 2, 854-871 (2011).
15
Reconstruction of hidden graphs and threshold group testing. (English)
J. Comb. Optim. 22, No. 2, 270-281 (2011).
16
Multi-vertex deletion graph reconstruction numbers. (English)
J. Comb. Math. Comb. Comput. 78, 303-321 (2011).
17
A polygon is determined by its angles. (English)
Comput. Geom. 44, No. 8, 418-426 (2011).
18
Variational surface reconstruction based on Delaunay triangulation and graph cut. (English)
Int. J. Numer. Methods Eng. 85, No. 2, 206-229 (2011).
19
Reconstructing matrices from minors. (English)
Linear Algebra Appl. 434, No. 7, 1733-1744 (2011).
20
Result 1 to 20 of 158 total
Start
Contact
Print
General Help
