|
|
Venues (Conferences, Journals, ...)
|
|
GrowBag graphs for keyword ? (Num. hits/coverage)
Group by:
The graphs summarize 3756 occurrences of 1741 keywords
|
|
|
Results
Found 9001 publication records. Showing 9001 according to the selection in the facets
Hits ?▲ |
Authors |
Title |
Venue |
Year |
Link |
Author keywords |
19 | Maxim Teslenko, Elena Dubrova |
A Linear-Time Algorithm for Finding All Double-Vertex Dominators of a Given Vertex. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CoRR ![In: CoRR abs/1503.04994, 2015. The full citation details ...](Pics/full.jpeg) |
2015 |
DBLP BibTeX RDF |
|
19 | Robert Ryan McCune, Tim Weninger, Greg Madey |
Thinking Like a Vertex: A Survey of Vertex-Centric Frameworks for Large-Scale Distributed Graph Processing. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ACM Comput. Surv. ![In: ACM Comput. Surv. 48(2), pp. 25:1-25:39, 2015. The full citation details ...](Pics/full.jpeg) |
2015 |
DBLP DOI BibTeX RDF |
|
19 | Primoz Potocnik, Pablo Spiga, Gabriel Verret |
Bounding the order of the vertex-stabiliser in 3-valent vertex-transitive and 4-valent arc-transitive graphs. ![Search on Bibsonomy](Pics/bibsonomy.png) |
J. Comb. Theory, Ser. B ![In: J. Comb. Theory, Ser. B 111, pp. 148-180, 2015. The full citation details ...](Pics/full.jpeg) |
2015 |
DBLP DOI BibTeX RDF |
|
19 | Keren Censor-Hillel, Mohsen Ghaffari 0001, George Giakkoupis, Bernhard Haeupler, Fabian Kuhn |
Tight Bounds on Vertex Connectivity Under Vertex Sampling. ![Search on Bibsonomy](Pics/bibsonomy.png) |
SODA ![In: Proceedings of the Twenty-Sixth Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2015, San Diego, CA, USA, January 4-6, 2015, pp. 2006-2018, 2015, SIAM, 978-1-61197-374-7. The full citation details ...](Pics/full.jpeg) |
2015 |
DBLP DOI BibTeX RDF |
|
19 | Amihood Amir, Benny Porat |
On the Hardness of Optimal Vertex Relabeling and Restricted Vertex Relabeling. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CPM ![In: Combinatorial Pattern Matching - 26th Annual Symposium, CPM 2015, Ischia Island, Italy, June 29 - July 1, 2015, Proceedings, pp. 1-12, 2015, Springer, 978-3-319-19928-3. The full citation details ...](Pics/full.jpeg) |
2015 |
DBLP DOI BibTeX RDF |
|
19 | Meirav Zehavi |
Maximum Minimal Vertex Cover Parameterized by Vertex Cover. ![Search on Bibsonomy](Pics/bibsonomy.png) |
MFCS (2) ![In: Mathematical Foundations of Computer Science 2015 - 40th International Symposium, MFCS 2015, Milan, Italy, August 24-28, 2015, Proceedings, Part II, pp. 589-600, 2015, Springer, 978-3-662-48053-3. The full citation details ...](Pics/full.jpeg) |
2015 |
DBLP DOI BibTeX RDF |
|
19 | Nadja Betzler, Hans L. Bodlaender, Robert Bredereck, Rolf Niedermeier, Johannes Uhlmann |
On Making a Distinguished Vertex of Minimum Degree by Vertex Deletion. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Algorithmica ![In: Algorithmica 68(3), pp. 715-738, 2014. The full citation details ...](Pics/full.jpeg) |
2014 |
DBLP DOI BibTeX RDF |
|
19 | Longjie Li 0001, Min Ma, Peng Lei, Mingwei Leng, Xiaoyun Chen |
S2R&R2S: A framework for ranking vertex and computing vertex-pair similarity simultaneously. ![Search on Bibsonomy](Pics/bibsonomy.png) |
J. Inf. Sci. ![In: J. Inf. Sci. 40(6), pp. 723-735, 2014. The full citation details ...](Pics/full.jpeg) |
2014 |
DBLP DOI BibTeX RDF |
|
19 | Zhiwen Fang, Yang Chu, Kan Qiao, Xu Feng, Ke Xu 0001 |
Combining Edge Weight and Vertex Weight for Minimum Vertex Cover Problem. ![Search on Bibsonomy](Pics/bibsonomy.png) |
FAW ![In: Frontiers in Algorithmics - 8th International Workshop, FAW 2014, Zhangjiajie, China, June 28-30, 2014. Proceedings, pp. 71-81, 2014, Springer, 978-3-319-08015-4. The full citation details ...](Pics/full.jpeg) |
2014 |
DBLP DOI BibTeX RDF |
|
19 | Marek Cygan, Marcin Pilipczuk |
Split Vertex Deletion meets Vertex Cover: New fixed-parameter and exact exponential-time algorithms. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Inf. Process. Lett. ![In: Inf. Process. Lett. 113(5-6), pp. 179-182, 2013. The full citation details ...](Pics/full.jpeg) |
2013 |
DBLP DOI BibTeX RDF |
|
19 | Binh-Minh Bui-Xuan, Jan Arne Telle, Martin Vatshelle |
Fast dynamic programming for locally checkable vertex subset and vertex partitioning problems. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Theor. Comput. Sci. ![In: Theor. Comput. Sci. 511, pp. 66-76, 2013. The full citation details ...](Pics/full.jpeg) |
2013 |
DBLP DOI BibTeX RDF |
|
19 | Sounaka Mishra, Ashwin Pananjady, N. Safina Devi |
On the Complexity of Making a Distinguished Vertex Minimum or Maximum Degree by Vertex Deletion. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CoRR ![In: CoRR abs/1312.3779, 2013. The full citation details ...](Pics/full.jpeg) |
2013 |
DBLP BibTeX RDF |
|
19 | Wen Yu 0003, Frans Coenen, Michele Zito 0001, Subhieh El-Salhi |
Vertex Unique Labelled Subgraph Mining for Vertex Label Classification. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ADMA (1) ![In: Advanced Data Mining and Applications, 9th International Conference, ADMA 2013, Hangzhou, China, December 14-16, 2013, Proceedings, Part I, pp. 542-553, 2013, Springer, 978-3-642-53913-8. The full citation details ...](Pics/full.jpeg) |
2013 |
DBLP DOI BibTeX RDF |
|
19 | Huirong Bao, Zhiye Zhao |
The vertex-to-vertex contact analysis in the two-dimensional discontinuous deformation analysis. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Adv. Eng. Softw. ![In: Adv. Eng. Softw. 45(1), pp. 1-10, 2012. The full citation details ...](Pics/full.jpeg) |
2012 |
DBLP DOI BibTeX RDF |
|
19 | Cheryl E. Praeger, Pablo Spiga, Gabriel Verret |
Bounding the size of a vertex-stabiliser in a finite vertex-transitive graph. ![Search on Bibsonomy](Pics/bibsonomy.png) |
J. Comb. Theory, Ser. B ![In: J. Comb. Theory, Ser. B 102(3), pp. 797-819, 2012. The full citation details ...](Pics/full.jpeg) |
2012 |
DBLP DOI BibTeX RDF |
|
19 | Martin Doucha, Jan Kratochvíl |
Cluster Vertex Deletion: A Parameterization between Vertex Cover and Clique-Width. ![Search on Bibsonomy](Pics/bibsonomy.png) |
MFCS ![In: Mathematical Foundations of Computer Science 2012 - 37th International Symposium, MFCS 2012, Bratislava, Slovakia, August 27-31, 2012. Proceedings, pp. 348-359, 2012, Springer, 978-3-642-32588-5. The full citation details ...](Pics/full.jpeg) |
2012 |
DBLP DOI BibTeX RDF |
|
19 | Elizabeth Beer, James Allen Fill, Svante Janson, Edward R. Scheinerman |
On Vertex, Edge, and Vertex-Edge Random Graphs. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Electron. J. Comb. ![In: Electron. J. Comb. 18(1), 2011. The full citation details ...](Pics/full.jpeg) |
2011 |
DBLP DOI BibTeX RDF |
|
19 | Hermann Gruber |
Bounding the Feedback Vertex Number of Digraphs in Terms of Vertex Degrees ![Search on Bibsonomy](Pics/bibsonomy.png) |
CoRR ![In: CoRR abs/1101.1291, 2011. The full citation details ...](Pics/full.jpeg) |
2011 |
DBLP BibTeX RDF |
|
19 | Hermann Gruber |
Bounding the feedback vertex number of digraphs in terms of vertex degrees. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Discret. Appl. Math. ![In: Discret. Appl. Math. 159(8), pp. 872-875, 2011. The full citation details ...](Pics/full.jpeg) |
2011 |
DBLP DOI BibTeX RDF |
|
19 | Yahya Ould Hamidoune, Anna S. Lladó, Susana-Clara López |
Vertex-transitive graphs that remain connected after failure of a vertex and its neighbors. ![Search on Bibsonomy](Pics/bibsonomy.png) |
J. Graph Theory ![In: J. Graph Theory 67(2), pp. 124-138, 2011. The full citation details ...](Pics/full.jpeg) |
2011 |
DBLP DOI BibTeX RDF |
|
19 | Elizabeth Beer, James Allen Fill, Svante Janson, Edward R. Scheinerman |
On Vertex, Edge, and Vertex-edge Random Graphs. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ANALCO ![In: Proceedings of the Eighth Workshop on Analytic Algorithmics and Combinatorics, ANALCO 2011, San Francisco, California, USA, January 22, 2011, pp. 16-22, 2011, SIAM, 978-1-61197-301-3. The full citation details ...](Pics/full.jpeg) |
2011 |
DBLP DOI BibTeX RDF |
|
19 | Nadja Betzler, Robert Bredereck, Rolf Niedermeier, Johannes Uhlmann |
On Making a Distinguished Vertex Minimum Degree by Vertex Deletion. ![Search on Bibsonomy](Pics/bibsonomy.png) |
SOFSEM ![In: SOFSEM 2011: Theory and Practice of Computer Science - 37th Conference on Current Trends in Theory and Practice of Computer Science, Nový Smokovec, Slovakia, January 22-28, 2011. Proceedings, pp. 123-134, 2011, Springer, 978-3-642-18380-5. The full citation details ...](Pics/full.jpeg) |
2011 |
DBLP DOI BibTeX RDF |
|
19 | Romain Campigotto |
Algorithmes d'approximation à mémoire limitée pour le traitement de grands graphes : le problème du Vertex Cover. (Approximation Algorithms with Low Memory Capacities for Large Graphs Processing : the Vertex Cover Problem). ![Search on Bibsonomy](Pics/bibsonomy.png) |
|
2011 |
RDF |
|
19 | Chih-Chiang Yu, Chien-Hsin Lin, Biing-Feng Wang |
Improved algorithms for finding length-bounded two vertex-disjoint paths in a planar graph and minmax k vertex-disjoint paths in a directed acyclic graph. ![Search on Bibsonomy](Pics/bibsonomy.png) |
J. Comput. Syst. Sci. ![In: J. Comput. Syst. Sci. 76(8), pp. 697-708, 2010. The full citation details ...](Pics/full.jpeg) |
2010 |
DBLP DOI BibTeX RDF |
|
19 | Steve Kirkland |
Algebraic connectivity for vertex-deleted subgraphs, and a notion of vertex centrality. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Discret. Math. ![In: Discret. Math. 310(4), pp. 911-921, 2010. The full citation details ...](Pics/full.jpeg) |
2010 |
DBLP DOI BibTeX RDF |
|
19 | Cai Heng Li, Liang Niu, Ákos Seress, Ronald Solomon |
The vertex primitive and vertex bi-primitive s-arc regular graphs. ![Search on Bibsonomy](Pics/bibsonomy.png) |
J. Comb. Theory, Ser. B ![In: J. Comb. Theory, Ser. B 100(4), pp. 359-366, 2010. The full citation details ...](Pics/full.jpeg) |
2010 |
DBLP DOI BibTeX RDF |
|
19 | Loukas Georgiadis |
Testing 2-Vertex Connectivity and Computing Pairs of Vertex-Disjoint s-t Paths in Digraphs. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ICALP (1) ![In: Automata, Languages and Programming, 37th International Colloquium, ICALP 2010, Bordeaux, France, July 6-10, 2010, Proceedings, Part I, pp. 738-749, 2010, Springer, 978-3-642-14164-5. The full citation details ...](Pics/full.jpeg) |
2010 |
DBLP DOI BibTeX RDF |
|
19 | Chang-Hyo Yu, Kyusik Chung, Donghyun Kim, Seok-Hoon Kim, Lee-Sup Kim |
A 186-Mvertices/s 161-mW Floating-Point Vertex Processor With Optimized Datapath and Vertex Caches. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IEEE Trans. Very Large Scale Integr. Syst. ![In: IEEE Trans. Very Large Scale Integr. Syst. 17(10), pp. 1369-1382, 2009. The full citation details ...](Pics/full.jpeg) |
2009 |
DBLP DOI BibTeX RDF |
|
19 | René van Bevern |
Graph-based data clustering: a quadratic-vertex problem kernel for s-Plex Cluster Vertex Deletion ![Search on Bibsonomy](Pics/bibsonomy.png) |
CoRR ![In: CoRR abs/0909.2814, 2009. The full citation details ...](Pics/full.jpeg) |
2009 |
DBLP BibTeX RDF |
|
19 | Binh-Minh Bui-Xuan, Jan Arne Telle, Martin Vatshelle |
Fast FPT algorithms for vertex subset and vertex partitioning problems using neighborhood unions ![Search on Bibsonomy](Pics/bibsonomy.png) |
CoRR ![In: CoRR abs/0903.4796, 2009. The full citation details ...](Pics/full.jpeg) |
2009 |
DBLP BibTeX RDF |
|
19 | François Delbot |
Au delà de l'évaluation en pire cas : comparaison et évaluation en moyenne de processus d'optimisation pour le problème du vertex cover et des arbres de connexion de groupes dynamiques. (Beyond the worst case evaluation: Comparison and average evaluation of optimization processes in the case of the vertex cover problem and trees connecting groups). ![Search on Bibsonomy](Pics/bibsonomy.png) |
|
2009 |
RDF |
|
19 | E. A. Yusov, V. E. Turlapov |
Adaptive terrain triangulation using the representation of quad trees by vertex textures and wavelet estimation of vertex significance. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Program. Comput. Softw. ![In: Program. Comput. Softw. 34(5), pp. 245-256, 2008. The full citation details ...](Pics/full.jpeg) |
2008 |
DBLP DOI BibTeX RDF |
|
19 | Chang-Hyo Yu, Kyusik Chung, Donghyun Kim, Lee-Sup Kim |
An Energy-Efficient Mobile Vertex Processor With Multithread Expanded VLIW Architecture and Vertex Caches. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IEEE J. Solid State Circuits ![In: IEEE J. Solid State Circuits 42(10), pp. 2257-2269, 2007. The full citation details ...](Pics/full.jpeg) |
2007 |
DBLP DOI BibTeX RDF |
|
19 | Yoshiyasu Ishigami |
Vertex-disjoint cycles of length at most four each of which contains a specified vertex. ![Search on Bibsonomy](Pics/bibsonomy.png) |
J. Graph Theory ![In: J. Graph Theory 37(1), pp. 37-47, 2001. The full citation details ...](Pics/full.jpeg) |
2001 |
DBLP DOI BibTeX RDF |
|
19 | Toshimasa Ishii, Hiroshi Nagamochi, Toshihide Ibaraki |
Optimal Augmentation of a 2-Vertex-Connected Multigraph to a k-Edge-Connected and 3-Vertex-Connected Multigraph. ![Search on Bibsonomy](Pics/bibsonomy.png) |
J. Comb. Optim. ![In: J. Comb. Optim. 4(1), pp. 35-77, 2000. The full citation details ...](Pics/full.jpeg) |
2000 |
DBLP DOI BibTeX RDF |
|
19 | Ralf Klasing |
The Relationship between the Gossip Complexity in Vertex-Disjoint Paths Mode and the Vertex Bisection Width. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Discret. Appl. Math. ![In: Discret. Appl. Math. 83(1-3), pp. 229-246, 1998. The full citation details ...](Pics/full.jpeg) |
1998 |
DBLP DOI BibTeX RDF |
|
19 | Adi Bar-Lev, Ayal Itzkovitz, Alon Raviv, Assaf Schuster |
Parallel Vertex-To-Vertex Radiosity on a Distributed Shared Memory System. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IRREGULAR ![In: Solving Irregularly Structured Problems in Parallel, 5th International Symposium, IRREGULAR '98, Berkeley, California, USA, August 9-11, 1998, Proceedings, pp. 238-250, 1998, Springer, 3-540-64809-7. The full citation details ...](Pics/full.jpeg) |
1998 |
DBLP DOI BibTeX RDF |
|
19 | Monika Rauch Henzinger |
A Static 2-Approximation Algorithm for Vertex Connectivity and Incremental Approximation Algorithms for Edge and Vertex Connectivity. ![Search on Bibsonomy](Pics/bibsonomy.png) |
J. Algorithms ![In: J. Algorithms 24(1), pp. 194-220, 1997. The full citation details ...](Pics/full.jpeg) |
1997 |
DBLP DOI BibTeX RDF |
|
19 | Adi Bar-Lev, Ayal Itzkovitz, Alon Raviv, Assaf Schuster |
Vertex-To-Vertex Parallel Radiosity on Clusters of PCs. ![Search on Bibsonomy](Pics/bibsonomy.png) |
WAE ![In: Workshop on Algorithm Engineering, WAE '97, Venezia, Italy, September 11-13, 1997. Proceedings., pp. 177-187, 1997, Università Ca' Foscari di Venezia. The full citation details ...](Pics/full.jpeg) |
1997 |
DBLP BibTeX RDF |
|
19 | Toshihiro Fujito |
A Note on Approximation of the Vertex Cover and Feedback Vertex Set Problems - Unified Approach. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Inf. Process. Lett. ![In: Inf. Process. Lett. 59(2), pp. 59-63, 1996. The full citation details ...](Pics/full.jpeg) |
1996 |
DBLP DOI BibTeX RDF |
|
19 | Nelson L. Max, Michael J. Allison |
Linear Radiosity Approximation using Vertex-to-Vertex Form Factors. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Graphics Gems III ![In: Graphics Gems III (IBM Version), pp. 318-323, 1992, Academic Press, 978-0-12-409673-8. The full citation details ...](Pics/full.jpeg) |
1992 |
DBLP DOI BibTeX RDF |
|
19 | Heiko Harborth |
Plane four-regular graphs with vertex-to-vertex unit triangles. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Discret. Math. ![In: Discret. Math. 97(1-3), pp. 219-222, 1991. The full citation details ...](Pics/full.jpeg) |
1991 |
DBLP DOI BibTeX RDF |
|
19 | László Babai |
Vertex-transitive graphs and vertex-transitive maps. ![Search on Bibsonomy](Pics/bibsonomy.png) |
J. Graph Theory ![In: J. Graph Theory 15(6), pp. 587-627, 1991. The full citation details ...](Pics/full.jpeg) |
1991 |
DBLP DOI BibTeX RDF |
|
19 | S. H. Chuang, Mark R. Henderson |
Three-dimensional shape pattern recognition using vertex classification and vertex-edge graphs. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Comput. Aided Des. ![In: Comput. Aided Des. 22(6), pp. 377-387, 1990. The full citation details ...](Pics/full.jpeg) |
1990 |
DBLP DOI BibTeX RDF |
|
19 | Richard J. Nowakowski, Peter Winkler 0001 |
Vertex-to-vertex pursuit in a graph. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Discret. Math. ![In: Discret. Math. 43(2-3), pp. 235-239, 1983. The full citation details ...](Pics/full.jpeg) |
1983 |
DBLP DOI BibTeX RDF |
|
19 | Kabekode V. S. Bhat |
Refined Vertex Codes and Vertex Partitioning Methodology for Graph Isomorphism Testing. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IEEE Trans. Syst. Man Cybern. ![In: IEEE Trans. Syst. Man Cybern. 10(10), pp. 610-615, 1980. The full citation details ...](Pics/full.jpeg) |
1980 |
DBLP DOI BibTeX RDF |
|
18 | André Renato Sales Amaral |
A mixed 0-1 linear programming formulation for the exact solution of the minimum linear arrangement problem. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Optim. Lett. ![In: Optim. Lett. 3(4), pp. 513-520, 2009. The full citation details ...](Pics/full.jpeg) |
2009 |
DBLP DOI BibTeX RDF |
Vertex ordering problems, Minimum linear arrangement, Integer programming |
18 | Michael Lampis, Valia Mitsou |
The Ferry Cover Problem. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Theory Comput. Syst. ![In: Theory Comput. Syst. 44(2), pp. 215-229, 2009. The full citation details ...](Pics/full.jpeg) |
2009 |
DBLP DOI BibTeX RDF |
Wolf-goat-cabbage puzzle, Approximation algorithms, Graph algorithms, Vertex cover, Transportation problems |
18 | Ju Wang 0001, Jonathan C. L. Liu |
Uplink relaying in hybrid wireless networks with out-of-cell interference reduction. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Wirel. Networks ![In: Wirel. Networks 15(8), pp. 1113-1125, 2009. The full citation details ...](Pics/full.jpeg) |
2009 |
DBLP DOI BibTeX RDF |
Uplink relaying, Out-cell-interference, Wireless network, WLAN, WCDMA, Vertex cover |
18 | Christos A. Athanasiadis |
On the Graph Connectivity of Skeleta of Convex Polytopes. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Discret. Comput. Geom. ![In: Discret. Comput. Geom. 42(2), pp. 155-165, 2009. The full citation details ...](Pics/full.jpeg) |
2009 |
DBLP DOI BibTeX RDF |
Balinski’s theorem, Incidence graph, Skeleton, Convex polytope, Cell complex, Vertex connectivity |
18 | Tammy M. K. Cheng, Yu-En Lu, Pietro Liò |
Identification of structurally important amino acids in proteins by graph-theoretic measures. ![Search on Bibsonomy](Pics/bibsonomy.png) |
KDD Workshop on Statistical and Relational Learning in Bioinformatics ![In: Proceedings of the ACM SIGKDD Workshop on Statistical and Relational Learning in Bioinformatics, Paris, France, June 28, 2009, pp. 7-11, 2009, ACM, 978-1-60558-667-0. The full citation details ...](Pics/full.jpeg) |
2009 |
DBLP DOI BibTeX RDF |
protein stability, graph theory, computational biology, vertex cover, protein structure |
18 | Kamrul Islam 0001, Selim G. Akl, Henk Meijer |
Distributed Generation of a Family of Connected Dominating Sets in Wireless Sensor Networks. ![Search on Bibsonomy](Pics/bibsonomy.png) |
DCOSS ![In: Distributed Computing in Sensor Systems, 5th IEEE International Conference, DCOSS 2009, Marina del Rey, CA, USA, June 8-10, 2009. Proceedings, pp. 343-355, 2009, Springer, 978-3-642-02084-1. The full citation details ...](Pics/full.jpeg) |
2009 |
DBLP DOI BibTeX RDF |
Minimum Vertex-cut, Wireless Sensor Network, Distributed Algorithm, Maximal Clique |
18 | Yuichi Yoshida, Masaki Yamamoto 0001, Hiro Ito |
An improved constant-time approximation algorithm for maximum matchings. ![Search on Bibsonomy](Pics/bibsonomy.png) |
STOC ![In: Proceedings of the 41st Annual ACM Symposium on Theory of Computing, STOC 2009, Bethesda, MD, USA, May 31 - June 2, 2009, pp. 225-234, 2009, ACM, 978-1-60558-506-2. The full citation details ...](Pics/full.jpeg) |
2009 |
DBLP DOI BibTeX RDF |
constant-time approximation algorithms, minimum vertex cover, property testing, maximum matching, minimum set cover |
18 | Venkatesh Raman 0001, Saket Saurabh 0001 |
Short Cycles Make W -hard Problems Hard: FPT Algorithms for W -hard Problems in Graphs with no Short Cycles. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Algorithmica ![In: Algorithmica 52(2), pp. 203-225, 2008. The full citation details ...](Pics/full.jpeg) |
2008 |
DBLP DOI BibTeX RDF |
t-vertex cover, Dominating set, Set cover, Independent set, Parameterized complexity |
18 | Pedro V. Sander, Diego Nehab, Eden Chlamtac, Hugues Hoppe |
Efficient traversal of mesh edges using adjacency primitives. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ACM Trans. Graph. ![In: ACM Trans. Graph. 27(5), pp. 144, 2008. The full citation details ...](Pics/full.jpeg) |
2008 |
DBLP DOI BibTeX RDF |
programmable geometry shader, vertex locality, real-time rendering, silhouettes, shadow volumes |
18 | David Avis, Bohdan Kaluzny |
Computing monotone disjoint paths on polytopes. ![Search on Bibsonomy](Pics/bibsonomy.png) |
J. Comb. Optim. ![In: J. Comb. Optim. 16(4), pp. 328-343, 2008. The full citation details ...](Pics/full.jpeg) |
2008 |
DBLP DOI BibTeX RDF |
Reverse search, Vertex enumeration, Holt-Klee, Linear programming, Network flow, Polytopes, Disjoint paths, Simplex method, Degeneracy |
18 | Hatem Tahri, Mourad Elloumi |
A New Approximation Algorithm for the Minimum Fragment Removal Problem. ![Search on Bibsonomy](Pics/bibsonomy.png) |
BIRD ![In: Bioinformatics Research and Development, Second International Conference, BIRD 2008, Vienna, Austria, July 7-9, 2008, Proceedings, pp. 427-435, 2008, Springer, 978-3-540-70598-7. The full citation details ...](Pics/full.jpeg) |
2008 |
DBLP DOI BibTeX RDF |
haplotype assembly, minimum fragment removal, vertex bipartization, algorithms, complexities, Graphs |
18 | Toru Hasunuma, Toshimasa Ishii, Hirotaka Ono 0001, Yushi Uno |
An Algorithm for L(2, 1)-Labeling of Trees. ![Search on Bibsonomy](Pics/bibsonomy.png) |
SWAT ![In: Algorithm Theory - SWAT 2008, 11th Scandinavian Workshop on Algorithm Theory, Gothenburg, Sweden, July 2-4, 2008, Proceedings, pp. 185-197, 2008, Springer, 978-3-540-69900-2. The full citation details ...](Pics/full.jpeg) |
2008 |
DBLP DOI BibTeX RDF |
frequency/channel assignment, L(2 and 1)-labeling, graph algorithm, vertex coloring |
18 | Rich Wareham, Joan Lasenby |
Bone Glow: An Improved Method for the Assignment of Weights for Mesh Deformation. ![Search on Bibsonomy](Pics/bibsonomy.png) |
AMDO ![In: Articulated Motion and Deformable Objects, 5th International Conference, AMDO 2008, Port d'Andratx, Mallorca, Spain, July 9-11, 2008, Proceedings, pp. 63-71, 2008, Springer, 978-3-540-70516-1. The full citation details ...](Pics/full.jpeg) |
2008 |
DBLP DOI BibTeX RDF |
skeletal animation, bone heat, bone glow, animation, skinning, mesh deformation, realtime, vertex weighting |
18 | Scott Schaefer, Tao Ju, Joe D. Warren |
Manifold Dual Contouring. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IEEE Trans. Vis. Comput. Graph. ![In: IEEE Trans. Vis. Comput. Graph. 13(3), pp. 610-619, 2007. The full citation details ...](Pics/full.jpeg) |
2007 |
DBLP DOI BibTeX RDF |
contour simplification, Isosurfacing, manifold, vertex clustering |
18 | Paul S. Bonsma, Luis Cereceda |
Finding Paths Between Graph Colourings: PSPACE-Completeness and Superpolynomial Distances. ![Search on Bibsonomy](Pics/bibsonomy.png) |
MFCS ![In: Mathematical Foundations of Computer Science 2007, 32nd International Symposium, MFCS 2007, Ceský Krumlov, Czech Republic, August 26-31, 2007, Proceedings, pp. 738-749, 2007, Springer, 978-3-540-74455-9. The full citation details ...](Pics/full.jpeg) |
2007 |
DBLP DOI BibTeX RDF |
vertex-recolouring, colour graph, superpolynomial distance, PSPACE-complete |
18 | Xiaona Zhang, Yunjie Zhang, Weina Wang 0002, Yi Li |
A Novel Approach for Fuzzy Connected Image Segmentation. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ICFIE ![In: Fuzzy Information and Engineering, Proceedings of the Second International Conference of Fuzzy Information and Engineering, ICFIE 2007, May 13-16, 2007, Guangzhou, China, pp. 89-97, 2007, Springer, 978-3-540-71440-8. The full citation details ...](Pics/full.jpeg) |
2007 |
DBLP DOI BibTeX RDF |
fuzzy connectedness, vertex set expanding, image segmentation, TABU search |
18 | Michael Lampis, Valia Mitsou |
The Ferry Cover Problem. ![Search on Bibsonomy](Pics/bibsonomy.png) |
FUN ![In: Fun with Algorithms, 4th International Conference, FUN 2007, Castiglioncello, Italy, June 3-5, 2007, Proceedings, pp. 227-239, 2007, Springer, 978-3-540-72913-6. The full citation details ...](Pics/full.jpeg) |
2007 |
DBLP DOI BibTeX RDF |
wolf-goat-cabbage puzzle, approximation algorithms, graph algorithms, vertex cover, transportation problems |
18 | Cornelis W. Oosterlee, Francisco José Gaspar Lorenz |
Multigrid Methods for the Stokes System. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Comput. Sci. Eng. ![In: Comput. Sci. Eng. 8(6), pp. 34-43, 2006. The full citation details ...](Pics/full.jpeg) |
2006 |
DBLP DOI BibTeX RDF |
coupled relaxation, decoupled distributive relaxation, staggered grid, vertex-centered grid, system transformation, Multigrid, Stokes equations |
18 | Pablo Diaz-Gutierrez, Anusheel Bhushan, M. Gopi 0001, Renato Pajarola |
Single-strips for fast interactive rendering. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Vis. Comput. ![In: Vis. Comput. 22(6), pp. 372-386, 2006. The full citation details ...](Pics/full.jpeg) |
2006 |
DBLP DOI BibTeX RDF |
Single-strip, Weighted perfect matching, Vertex cache, Hamiltonian cycle, Visibility culling |
18 | Shaun Bangay, Chantelle Morkel |
Graph matching with subdivision surfaces for texture synthesis on surfaces. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Afrigraph ![In: Proceedings of the 4th International Conference on Virtual Reality, Computer Graphics, Visualisation and Interaction in Africa, Afrigraph 2006, Cape Town, South Africa, January 25-27, 2006, pp. 65-74, 2006, ACM, 1-59593-288-7. The full citation details ...](Pics/full.jpeg) |
2006 |
DBLP DOI BibTeX RDF |
vertex region matching, texture synthesis, subdivision surfaces, graph cut |
18 | Amos Beimel, Paz Carmi, Kobbi Nissim, Enav Weinreb |
Private approximation of search problems. ![Search on Bibsonomy](Pics/bibsonomy.png) |
STOC ![In: Proceedings of the 38th Annual ACM Symposium on Theory of Computing, Seattle, WA, USA, May 21-23, 2006, pp. 119-128, 2006, ACM, 1-59593-134-1. The full citation details ...](Pics/full.jpeg) |
2006 |
DBLP DOI BibTeX RDF |
private approximation, solution-list algorithm, vertex cover, secure computation |
18 | Vic Grout |
Principles of Cost Minimisation in Wireless Networks. ![Search on Bibsonomy](Pics/bibsonomy.png) |
J. Heuristics ![In: J. Heuristics 11(2), pp. 115-133, 2005. The full citation details ...](Pics/full.jpeg) |
2005 |
DBLP DOI BibTeX RDF |
minimum connected vertex cover problem, node constraints, edge constraints, path constraints, load constraints, add algorithm, drop algorithm, wireless networks |
18 | Mingyou Hu, Abdul Hamid Sadka, Stewart Worrall, Ahmet M. Kondoz |
Scalable shape coding of video objects using temporal prediction. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ICME ![In: Proceedings of the 2005 IEEE International Conference on Multimedia and Expo, ICME 2005, July 6-9, 2005, Amsterdam, The Netherlands, pp. 703-706, 2005, IEEE Computer Society, 0-7803-9331-7. The full citation details ...](Pics/full.jpeg) |
2005 |
DBLP DOI BibTeX RDF |
scalable vertex-based shape coding scheme, temporal prediction, coarser layer, R-D performance, video objects, contour matching |
18 | André Diatta, Peter J. Giblin |
Geometry of Isophote Curves. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Scale-Space ![In: Scale Space and PDE Methods in Computer Vision, 5th International Conference, Scale-Space 2005, Hofgeismar, Germany, April 7-9, 2005, Proceedings, pp. 50-61, 2005, Springer, 3-540-25547-8. The full citation details ...](Pics/full.jpeg) |
2005 |
DBLP DOI BibTeX RDF |
Isophote curve, symmetry set, inflexion, skeleton, shape analysis, medial axis, vertex |
18 | Emad Y. Ramadan, Arijit Tarafdar, Alex Pothen |
A Hypergraph Model for the Yeast Protein Complex Network. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IPDPS ![In: 18th International Parallel and Distributed Processing Symposium (IPDPS 2004), CD-ROM / Abstracts Proceedings, 26-30 April 2004, Santa Fe, New Mexico, USA, 2004, IEEE Computer Society, 0-7695-2132-0. The full citation details ...](Pics/full.jpeg) |
2004 |
DBLP DOI BibTeX RDF |
protein complex network, power-law network, graph core, hypergraph, vertex cover, small-world network |
18 | Stefan Porschen, Ewald Speckenmeyer |
Worst Case Bounds for Some NP-Complete Modified Horn-SAT Problems. ![Search on Bibsonomy](Pics/bibsonomy.png) |
SAT (Selected Papers ![In: Theory and Applications of Satisfiability Testing, 7th International Conference, SAT 2004, Vancouver, BC, Canada, May 10-13, 2004, Revised Selected Papers, pp. 251-262, 2004, Springer, 3-540-27829-X. The full citation details ...](Pics/full.jpeg) |
2004 |
DBLP DOI BibTeX RDF |
(hidden) Horn formula, quadratic formula, minimal vertex cover, NP-completeness, satisfiability, fixed-parameter tractability |
18 | Keqin Li |
Performance Evaluation of Heuristic Algorithms for Wavelength Assignment in WDM Optical Networks. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ICPP Workshops ![In: 33rd International Conference on Parallel Processing Workshops (ICPP 2004 Workshops), 15-18 August 2004, Montreal, Quebec, Canada, pp. 399-406, 2004, IEEE Computer Society, 0-7695-2198-3. The full citation details ...](Pics/full.jpeg) |
2004 |
DBLP DOI BibTeX RDF |
Average-case performance, heuristic, mesh, optical network, wavelength division multiplexing, wavelength assignment, random network, vertex coloring |
18 | Radoslaw Mantiuk, Karina Murawko-Wisniewska, Dorota Zdrojewska |
Interactive Visualization of Relativistic Effects with the Hardware Acceleration. ![Search on Bibsonomy](Pics/bibsonomy.png) |
International Conference on Computational Science ![In: Computational Science - ICCS 2004, 4th International Conference, Kraków, Poland, June 6-9, 2004, Proceedings, Part IV, pp. 264-269, 2004, Springer, 3-540-22129-8. The full citation details ...](Pics/full.jpeg) |
2004 |
DBLP DOI BibTeX RDF |
rendering of relativistic effects, vertex and pixel shaders, interactive image synthesis, computer graphics |
18 | Fabian Kuhn, Thomas Moscibroda, Roger Wattenhofer |
What cannot be computed locally! ![Search on Bibsonomy](Pics/bibsonomy.png) |
PODC ![In: Proceedings of the Twenty-Third Annual ACM Symposium on Principles of Distributed Computing, PODC 2004, St. John's, Newfoundland, Canada, July 25-28, 2004, pp. 300-309, 2004, ACM, 1-58113-802-4. The full citation details ...](Pics/full.jpeg) |
2004 |
DBLP DOI BibTeX RDF |
approximation hardness, distributed algorithms, locality, lower bounds, dominating set, vertex cover, maximal independent set, maximal matching |
18 | Ryuhei Uehara |
Linear Time Algorithms on Chordal Bipartite and Strongly Chordal Graphs. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ICALP ![In: Automata, Languages and Programming, 29th International Colloquium, ICALP 2002, Malaga, Spain, July 8-13, 2002, Proceedings, pp. 993-1004, 2002, Springer, 3-540-43864-5. The full citation details ...](Pics/full.jpeg) |
2002 |
DBLP DOI BibTeX RDF |
Chordal bipartite graphs, lexicographic breadth first search, vertex elimination ordering, strongly chordal graphs, design and analysis of algorithms |
18 | Shuntaro Yamazaki, Kiwamu Kase, Katsushi Ikeuchi |
Interactive Visualization of Non-Manifold Implicit Surfaces Using Pre-Integrated Volume Rendering . ![Search on Bibsonomy](Pics/bibsonomy.png) |
PG ![In: 10th Pacific Conference on Computer Graphics and Applications, PG 2002, Beijing, China, October 9-11, 2002, pp. 475-476, 2002, IEEE Computer Society, 0-7695-1784-6. The full citation details ...](Pics/full.jpeg) |
2002 |
DBLP DOI BibTeX RDF |
segmented distance, vertex generation diagram, volume rendering, implicit surfaces, non-manifold |
18 | Alessandro Panconesi, Romeo Rizzi |
Some simple distributed algorithms for sparse networks. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Distributed Comput. ![In: Distributed Comput. 14(2), pp. 97-100, 2001. The full citation details ...](Pics/full.jpeg) |
2001 |
DBLP DOI BibTeX RDF |
Vertex colouring, Edge colouring, Distributed computing, Maximal independent set, Sparse networks, Maximal matching |
18 | Lu Ruan 0001, Ding-Zhu Du, Xiao-Dong Hu 0001, Xiaohua Jia, Deying Li 0001, Zheng Sun |
Converter Placement Supporting Broadcast in WDM Optical Networks. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IEEE Trans. Computers ![In: IEEE Trans. Computers 50(7), pp. 750-758, 2001. The full citation details ...](Pics/full.jpeg) |
2001 |
DBLP DOI BibTeX RDF |
converter placement, Color-Covering, Vertex Color-Covering, optical networks, WDM, Network optimization |
18 | Maytham Safar, Cyrus Shahabi, Cheng-Hai Tan |
Resiliency and Robustness of Alternative Shape-Based Image Retrieval. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IDEAS ![In: 2000 International Database Engineering and Applications Symposium, IDEAS 2000, September 18-20, 2000, Yokohoma, Japan, Proccedings, pp. 337-348, 2000, IEEE Computer Society, 0-7695-0789-1. The full citation details ...](Pics/full.jpeg) |
2000 |
DBLP DOI BibTeX RDF |
shape-based image retrieval techniques, multimedia similarity retrieval, shape representation techniques, shape-based object retrieval, retrieval accuracy, MBC-TPVAS, minimum bounding circle, touch-point vertex-angle sequence, performance, robustness, image retrieval, uncertainty, noise, resiliency, precision, discrepancies, human perception, recall, corner points |
18 | Marc Alexa, Daniel Cohen-Or, David Levin |
As-rigid-as-possible shape interpolation. ![Search on Bibsonomy](Pics/bibsonomy.png) |
SIGGRAPH ![In: Proceedings of the 27th Annual Conference on Computer Graphics and Interactive Techniques, SIGGRAPH 2000, New Orleans, LA, USA, July 23-28, 2000, pp. 157-164, 2000, ACM, 1-58113-208-5. The full citation details ...](Pics/full.jpeg) |
2000 |
DBLP DOI BibTeX RDF |
compatible triangulation, vertex path problem, shape blending |
18 | Han Ju Yu, Jong Beom Ra |
Fast triangular mesh approximation of surface data using wavelet coefficients. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Vis. Comput. ![In: Vis. Comput. 15(1), pp. 9-20, 1999. The full citation details ...](Pics/full.jpeg) |
1999 |
DBLP DOI BibTeX RDF |
Triangular mesh approximation, Vertex removal, Terrain data, Wavelet transform, 3D visualization |
18 | Aiguo Xie, Peter A. Beerel |
Accelerating Markovian Analysis of Asynchronous Systems using String- based State Compression. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ASYNC ![In: 4th International Symposium on Advanced Research in Asynchronous Circuits and Systems (ASYNC '98), 30 March - 2 April 1998, San Diego, CA, USA, pp. 247-, 1998, IEEE Computer Society, 0-8186-8392-9. The full citation details ...](Pics/full.jpeg) |
1998 |
DBLP DOI BibTeX RDF |
stationary analysis, state compression, performance evaluation, Asynchronous systems, power estimation, convergence rate, Markov chain models, feedback vertex set |
18 | Claus B. Madsen |
A comparative study of the robustness of two pose estimation techniques. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Mach. Vis. Appl. ![In: Mach. Vis. Appl. 9(5/6), pp. 291-303, 1997. The full citation details ...](Pics/full.jpeg) |
1997 |
DBLP DOI BibTeX RDF |
Robustness, Noise, Pose estimation, Sensitivity, Viewpoint, Vertex |
18 | Daniela Ferrero, Carles Padró |
Fault-Tolerant Routings in Large Generalized Cycles. ![Search on Bibsonomy](Pics/bibsonomy.png) |
SCCC ![In: Proceedings of 17th International Conference of the Chilean Computer Science Society (SCCC '97), November 12-14, 1997, Valpariso, Chile, pp. 58-65, 1997, IEEE Computer Society, 0-8186-8052-0. The full citation details ...](Pics/full.jpeg) |
1997 |
DBLP DOI BibTeX RDF |
fault-tolerant routing algorithms, de Bruijn generalized cycles, Kautz generalized cycles, generalized p-cycle, vertex set partitioning, faulty elements, directed graphs, diameter, digraph, ordered set, path length |
18 | Oswaldo Vernet, Lilian Markenzon |
Hamiltonian Problems for Reducible Flowgraphs. ![Search on Bibsonomy](Pics/bibsonomy.png) |
SCCC ![In: Proceedings of 17th International Conference of the Chilean Computer Science Society (SCCC '97), November 12-14, 1997, Valpariso, Chile, pp. 264-267, 1997, IEEE Computer Society, 0-8186-8052-0. The full citation details ...](Pics/full.jpeg) |
1997 |
DBLP DOI BibTeX RDF |
Hamiltonian problems, reducible flowgraphs, unique Hamiltonian cycle, source vertex, Hamiltonian cycle, Hamiltonian path, flow graphs |
18 | Marcelo M. de Azevedo, Nader Bagherzadeh, Shahram Latifi |
Fault-diameter of the star-connected cycles interconnection network. ![Search on Bibsonomy](Pics/bibsonomy.png) |
HICSS (2) ![In: 28th Annual Hawaii International Conference on System Sciences (HICSS-28), January 3-6, 1995, Kihei, Maui, Hawaii, USA, pp. 469-478, 1995, IEEE Computer Society, 0-8186-6945-4. The full citation details ...](Pics/full.jpeg) |
1995 |
DBLP DOI BibTeX RDF |
star-connected cycles interconnection network, maximum diameter, fault-free, fixed constant, fault tolerance, reliability, graph theory, parallel architectures, fault tolerant computing, graph, multiprocessor interconnection networks, vertex connectivity, fault-diameter |
18 | Sabine R. Öhring, Falguni Sarkar, Sajal K. Das 0001, Dirk H. Hohndel |
Cayley graph connected cycles: A new class of fixed-degree interconnection networks. ![Search on Bibsonomy](Pics/bibsonomy.png) |
HICSS (2) ![In: 28th Annual Hawaii International Conference on System Sciences (HICSS-28), January 3-6, 1995, Kihei, Maui, Hawaii, USA, pp. 479-488, 1995, IEEE Computer Society, 0-8186-6945-4. The full citation details ...](Pics/full.jpeg) |
1995 |
DBLP DOI BibTeX RDF |
Cayley graph connected cycles, fixed-degree interconnection networks, vertex-symmetric networks, maximally fault tolerant networks, abelian generator-sets, graph theory, fault tolerant computing, multiprocessor interconnection networks, routing algorithms, hypercube networks, network routing, broadcasting algorithms, cube-connected cycles, average distance |
18 | Anthony D. Johnson |
On locally optimal breaking of nondisjoint cyclic vertical constraints in VLSI channel routing. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Great Lakes Symposium on VLSI ![In: 5th Great Lakes Symposium on VLSI (GLS-VLSI '95), March 16-18, 1995, The State University of New York at Buffalo, USA, pp. 204-207, 1995, IEEE Computer Society, 0-8186-7035-5. The full citation details ...](Pics/full.jpeg) |
1995 |
DBLP DOI BibTeX RDF |
locally optimal breaking strategy, nondisjoint cyclic vertical constraints, VLSI channel routing, vertical constraint graph, nondisjoint circuits, common vertex, common path, channel router heuristics, automatic routers, interactive routers, VLSI, graph theory, parallel architectures, network routing, circuit layout CAD, integrated circuit layout |
18 | Eiichi Tanaka |
A Metric Between Unrooted and Unordered Trees and its Bottom-Up Computing Method. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IEEE Trans. Pattern Anal. Mach. Intell. ![In: IEEE Trans. Pattern Anal. Mach. Intell. 16(12), pp. 1233-1238, 1994. The full citation details ...](Pics/full.jpeg) |
1994 |
DBLP DOI BibTeX RDF |
unrooted trees, unordered trees, bottom-up computing method, strongly structure-preserving mapping, vertex correspondences, similar substructures, similar structure search, pattern recognition, computational complexity, dynamic programming, dynamic programming, pattern matching, pattern matching, similarity, time complexity, trees (mathematics), space complexity, distance metric, maximum degrees |
18 | Alain Cournier, Michel Habib |
A New Linear Algorithm for Modular Decomposition. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CAAP ![In: Trees in Algebra and Programming - CAAP'94, 19th International Colloquium, Edinburgh, UK, April 11-13, 1994, Proceedings, pp. 68-84, 1994, Springer, 3-540-57879-X. The full citation details ...](Pics/full.jpeg) |
1994 |
DBLP DOI BibTeX RDF |
autonomous subsets, clans, graph decomposition trees, vertex-splitting. cotrees, Graphs, modules, substitution, cographs, prime graphs |
18 | Emden R. Gansner, Eleftherios Koutsofios, Stephen C. North, Kiem-Phong Vo |
A Technique for Drawing Directed Graphs. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IEEE Trans. Software Eng. ![In: IEEE Trans. Software Eng. 19(3), pp. 214-230, 1993. The full citation details ...](Pics/full.jpeg) |
1993 |
DBLP DOI BibTeX RDF |
four-pass algorithm, optimal rank assignment, network simplex algorithm, vertex order, iterative heuristic, novel weight function, local transpositions, optimal coordinates, auxiliary graph, computer graphics, optimisation, directed graphs, directed graphs, splines, splines (mathematics) |
18 | John M. Gauch, Stephen M. Pizer |
Multiresolution Analysis of Ridges and Valleys in Grey-Scale Images. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IEEE Trans. Pattern Anal. Mach. Intell. ![In: IEEE Trans. Pattern Anal. Mach. Intell. 15(6), pp. 635-646, 1993. The full citation details ...](Pics/full.jpeg) |
1993 |
DBLP DOI BibTeX RDF |
geophysical techniques, multiresolution behavior, vertex curves, global drainage patterns, watershed boundaries, geophysical techniques, rain, topography (Earth), image segmentation, remote sensing, remote sensing, differential geometry, differential geometry, ridges, terrain map, interactive image segmentation, valleys, rainfall, geophysics computing, grey-scale images |
18 | Chuan-Heng Ang, Hanan Samet, Clifford A. Shaffer |
A New Region Expansion for Quadtrees. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IEEE Trans. Pattern Anal. Mach. Intell. ![In: IEEE Trans. Pattern Anal. Mach. Intell. 12(7), pp. 682-686, 1990. The full citation details ...](Pics/full.jpeg) |
1990 |
DBLP DOI BibTeX RDF |
region expansion, one-pass algorithm, white pixels, black mode, black nodes, merging cluster, vertex set, pattern recognition, pattern recognition, picture processing, trees (mathematics), quadtrees |
18 | Ziv Gigus, Jitendra Malik |
Computing the Aspect Graph for Line Drawings of Polyhedral Objects. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IEEE Trans. Pattern Anal. Mach. Intell. ![In: IEEE Trans. Pattern Anal. Mach. Intell. 12(2), pp. 113-122, 1990. The full citation details ...](Pics/full.jpeg) |
1990 |
DBLP DOI BibTeX RDF |
3D object representation, edge projection, accidental viewpoints, pattern recognition, pattern recognition, computational geometry, graph theory, picture processing, picture processing, geometry, line drawings, aspect graph, vertex, polyhedral objects, Gaussian sphere |
18 | Jason S. J. Chen, Victor O. K. Li |
Optimizing Joins in Fragmented Database Systems on a Broadcast Local Network. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IEEE Trans. Software Eng. ![In: IEEE Trans. Software Eng. 15(1), pp. 26-38, 1989. The full citation details ...](Pics/full.jpeg) |
1989 |
DBLP DOI BibTeX RDF |
fragmented database systems, broadcast local network, minimum-weight vertex cover, join-analysis graph, parallelism, relational databases, distributed databases, concurrency control, redundancy, local area networks, NP hardness, relations |
18 | R. T. Jacob, Ivor P. Page |
Synthesis of Mutual Exclusion Solutions Based on Binary Semaphores. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IEEE Trans. Software Eng. ![In: IEEE Trans. Software Eng. 15(5), pp. 560-568, 1989. The full citation details ...](Pics/full.jpeg) |
1989 |
DBLP DOI BibTeX RDF |
mutual exclusion solutions, binary semaphores, graphical form, mutual exclusion constraint, edge semaphore solution, edge solvable, entry, exit sections, graph theory, operating systems (computers), graph grammar, efficient algorithm, vertex, forbidden subgraph, mutual exclusion problem |
15 | Ran Duan, Seth Pettie |
Connectivity oracles for failure prone graphs. ![Search on Bibsonomy](Pics/bibsonomy.png) |
STOC ![In: Proceedings of the 42nd ACM Symposium on Theory of Computing, STOC 2010, Cambridge, Massachusetts, USA, 5-8 June 2010, pp. 465-474, 2010, ACM, 978-1-4503-0050-6. The full citation details ...](Pics/full.jpeg) |
2010 |
DBLP DOI BibTeX RDF |
connectivity |
15 | Sharon Marko, Dana Ron |
Approximating the distance to properties in bounded-degree and general sparse graphs. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ACM Trans. Algorithms ![In: ACM Trans. Algorithms 5(2), pp. 22:1-22:28, 2009. The full citation details ...](Pics/full.jpeg) |
2009 |
DBLP DOI BibTeX RDF |
Sublinear approximation algorithms, property testing, graph properties, distance approximation |
15 | Erik D. Demaine, MohammadTaghi Hajiaghayi, Ken-ichi Kawarabayashi |
Algorithmic Graph Minor Theory: Improved Grid Minor Bounds and Wagner's Contraction. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Algorithmica ![In: Algorithmica 54(2), pp. 142-180, 2009. The full citation details ...](Pics/full.jpeg) |
2009 |
DBLP DOI BibTeX RDF |
Bidimensionality, Wagner’s conjecture, Graph algorithms, Treewidth, Graph minors, Grid graphs |
Displaying result #501 - #600 of 9001 (100 per page; Change: ) Pages: [ <<][ 1][ 2][ 3][ 4][ 5][ 6][ 7][ 8][ 9][ 10][ 11][ 12][ 13][ 14][ 15][ >>] |
|