|
|
Venues (Conferences, Journals, ...)
|
|
GrowBag graphs for keyword ? (Num. hits/coverage)
Group by:
The graphs summarize 399 occurrences of 272 keywords
|
|
|
Results
Found 893 publication records. Showing 893 according to the selection in the facets
Hits ?▲ |
Authors |
Title |
Venue |
Year |
Link |
Author keywords |
99 | Ding-Zhu Du, Yuh-Dauh Lyuu, D. Frank Hsu |
Line Digraph Iterations and Spread Concept - with Application to Graph Theory, Fault Tolerance, and Routing. ![Search on Bibsonomy](Pics/bibsonomy.png) |
WG ![In: 17th International Workshop, WG '91, Fischbachau, Germany, June 17-19, 1991, Proceedings, pp. 169-179, 1991, Springer, 3-540-55121-2. The full citation details ...](Pics/full.jpeg) |
1991 |
DBLP DOI BibTeX RDF |
line digraph iteration, diameter vulnerability, k-diameter, fault tolerance, graph, connectivity, container, de Bruijn graph, spread, Kautz graph |
80 | Geir Agnarsson, Ágúst S. Egilsson, Magnús M. Halldórsson |
Proper Down-Coloring Simple Acyclic Digraphs. ![Search on Bibsonomy](Pics/bibsonomy.png) |
AGTIVE ![In: Applications of Graph Transformations with Industrial Relevance, Second International Workshop, AGTIVE 2003, Charlottesville, VA, USA, September 27 - October 1, 2003, Revised Selected and Invited Papers, pp. 299-312, 2003, Springer, 3-540-22120-4. The full citation details ...](Pics/full.jpeg) |
2003 |
DBLP DOI BibTeX RDF |
multidimensional clustering, acyclic digraph, ancestor, descendant, down-set, Relational databases, indexing, hypergraph, poset, digraph, vertex coloring, bitmap indexing |
69 | Yosuke Kikuchi, Shingo Osawa, Yukio Shibata |
Broadcasting in Generalized de Bruijn Digraphs. ![Search on Bibsonomy](Pics/bibsonomy.png) |
COCOON ![In: Computing and Combinatorics, 8th Annual International Conference, COCOON 2002, Singapore, August 15-17, 2002, Proceedings, pp. 200-209, 2002, Springer, 3-540-43996-X. The full citation details ...](Pics/full.jpeg) |
2002 |
DBLP DOI BibTeX RDF |
generalized de Bruijn digraph, Imase Itoh digraph, k-ramified tree, broadcasting, Kronecker product |
64 | Walter Didimo |
Computing Upward Planar Drawings Using Switch-Regularity Heuristics. ![Search on Bibsonomy](Pics/bibsonomy.png) |
SOFSEM ![In: SOFSEM 2005: Theory and Practice of Computer Science, 31st Conference on Current Trends in Theory and Practice of Computer Science, Liptovský Ján, Slovakia, January 22-28, 2005, Proceedings, pp. 117-126, 2005, Springer, 3-540-24302-X. The full citation details ...](Pics/full.jpeg) |
2005 |
DBLP DOI BibTeX RDF |
|
64 | Toru Hasunuma |
Laying Out Iterated Line Digraphs Using Queues. ![Search on Bibsonomy](Pics/bibsonomy.png) |
GD ![In: Graph Drawing, 11th International Symposium, GD 2003, Perugia, Italy, September 21-24, 2003, Revised Papers, pp. 202-213, 2003, Springer, 3-540-20831-3. The full citation details ...](Pics/full.jpeg) |
2003 |
DBLP DOI BibTeX RDF |
|
61 | Boting Yang, Yi Cao |
Monotonicity of strong searching on digraphs. ![Search on Bibsonomy](Pics/bibsonomy.png) |
J. Comb. Optim. ![In: J. Comb. Optim. 14(4), pp. 411-425, 2007. The full citation details ...](Pics/full.jpeg) |
2007 |
DBLP DOI BibTeX RDF |
Cops-and-robber game, Pursuit-and-evasion problem, NP-complete, Monotonicity, Graph searching, Digraph |
59 | Boting Yang, Yi Cao |
Digraph Strong Searching: Monotonicity and Complexity. ![Search on Bibsonomy](Pics/bibsonomy.png) |
AAIM ![In: Algorithmic Aspects in Information and Management, Third International Conference, AAIM 2007, Portland, OR, USA, June 6-8, 2007, Proceedings, pp. 37-46, 2007, Springer, 978-3-540-72868-9. The full citation details ...](Pics/full.jpeg) |
2007 |
DBLP DOI BibTeX RDF |
|
54 | Stephan Kreutzer, Sebastian Ordyniak |
Digraph Decompositions and Monotonicity in Digraph Searching. ![Search on Bibsonomy](Pics/bibsonomy.png) |
WG ![In: Graph-Theoretic Concepts in Computer Science, 34th International Workshop, WG 2008, Durham, UK, June 30 - July 2, 2008. Revised Papers, pp. 336-347, 2008, 978-3-540-92247-6. The full citation details ...](Pics/full.jpeg) |
2008 |
DBLP DOI BibTeX RDF |
|
53 | Deli Zhao, Zhouchen Lin, Xiaoou Tang |
Contextual Distance for Data Perception. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ICCV ![In: IEEE 11th International Conference on Computer Vision, ICCV 2007, Rio de Janeiro, Brazil, October 14-20, 2007, pp. 1-8, 2007, IEEE Computer Society, 978-1-4244-1630-1. The full citation details ...](Pics/full.jpeg) |
2007 |
DBLP DOI BibTeX RDF |
|
51 | Miguel Angel Fiol, J. Luis A. Yebra, Ignacio Alegre de Miquel |
Line Digraph Iterations and the (d, k) Digraph Problem. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IEEE Trans. Computers ![In: IEEE Trans. Computers 33(5), pp. 400-403, 1984. The full citation details ...](Pics/full.jpeg) |
1984 |
DBLP DOI BibTeX RDF |
(d, k) graph problem, line digraph, Moore bound, routing algorithm, Communication network |
48 | Nicola Pio Belfiore, Umberto Berti, Aldo Mondino, Matteo Verotti |
A Comprehensive Evaluation of the Efficiency of an Integrated Biogas, Trigen, PV and Greenhouse Plant, Using Digraph Theory. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Towards Intelligent Engineering and Information Technology ![In: Towards Intelligent Engineering and Information Technology, pp. 595-605, 2009, Springer, 978-3-642-03736-8. The full citation details ...](Pics/full.jpeg) |
2009 |
DBLP DOI BibTeX RDF |
|
48 | Zhibo Ren, Qiang Zhang, Xiujuan Ma |
Efficiently Mining Maximal Frequent Itemsets Based on Digraph. ![Search on Bibsonomy](Pics/bibsonomy.png) |
FSKD (2) ![In: Fourth International Conference on Fuzzy Systems and Knowledge Discovery, FSKD 2007, 24-27 August 2007, Haikou, Hainan, China, Proceedings, Volume 2, pp. 140-143, 2007, IEEE Computer Society. The full citation details ...](Pics/full.jpeg) |
2007 |
DBLP DOI BibTeX RDF |
|
48 | Genjiu Xu, Xueliang Li 0001, Shenggui Zhang |
The Binding Number of a Digraph. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CJCDGCGT ![In: Discrete Geometry, Combinatorics and Graph Theory, 7th China-Japan Conference, CJCDGCGT 2005, Tianjin, China, November 18-20, 2005, Xi'an, China, November 22-24, 2005, Revised Selected Papers, pp. 221-227, 2005, Springer, 978-3-540-70665-6. The full citation details ...](Pics/full.jpeg) |
2005 |
DBLP DOI BibTeX RDF |
Binding number, Caccetta-Häggkvist Conjecture, directed graph, girth |
48 | Ling Chen 0005, Li Tu, Hongjian Chen |
A Novel Ant Clustering Algorithm with Digraph. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ICNC (2) ![In: Advances in Natural Computation, First International Conference, ICNC 2005, Changsha, China, August 27-29, 2005, Proceedings, Part II, pp. 1218-1228, 2005, Springer, 3-540-28325-0. The full citation details ...](Pics/full.jpeg) |
2005 |
DBLP DOI BibTeX RDF |
|
48 | Hsun-Wen Chang, Pei-Fang Tsai |
Characterizing the reconstruction and enumerating the patterns of DNA sequences with repeats. ![Search on Bibsonomy](Pics/bibsonomy.png) |
J. Comb. Optim. ![In: J. Comb. Optim. 14(2-3), pp. 331-347, 2007. The full citation details ...](Pics/full.jpeg) |
2007 |
DBLP DOI BibTeX RDF |
DNA digraph, Reduced digraph, Pattern graph, Combinatorial enumeration, Catalan number, Repeat, DNA sequencing |
46 | Xiao Ming Zhou, Chuan-Heng Ang, Tok Wang Ling |
Dynamic interactive spatial similarity retrieval in iconic image databases using enhanced digraph. ![Search on Bibsonomy](Pics/bibsonomy.png) |
SAC ![In: Proceedings of the 2006 ACM Symposium on Applied Computing (SAC), Dijon, France, April 23-27, 2006, pp. 46-51, 2006, ACM, 1-59593-108-2. The full citation details ...](Pics/full.jpeg) |
2006 |
DBLP DOI BibTeX RDF |
enhanced digraph, iconic image databases, interactive, spatial relationship, similarity retrieval |
46 | Peter Borm, René van den Brink, Marco Slikker |
An Iterative Procedure for Evaluating Digraph Competitions. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Ann. Oper. Res. ![In: Ann. Oper. Res. 109(1-4), pp. 61-75, 2002. The full citation details ...](Pics/full.jpeg) |
2002 |
DBLP DOI BibTeX RDF |
digraph competitions, limit measure, relational power measure, stochastic processes, cooperative games, Shapley value |
46 | Sukhamay Kundu |
An O(V) algorithm M for computing transitive reduction of a planar acyclic digraph. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ACM Southeast Regional Conference ![In: Proceedings of the 20th Annual Southeast Regional Conference, 1982, Knoxville, Tennessee, USA, April 1-3, 1982, pp. 29, 1982, ACM, 0-89791-071-0. The full citation details ...](Pics/full.jpeg) |
1982 |
DBLP DOI BibTeX RDF |
planar digraph, transitive reduction, algorithm, depth-first search |
43 | Tamara Mchedlidze, Antonios Symvonis |
Crossing-Free Acyclic Hamiltonian Path Completion for Planar st-Digraphs. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ISAAC ![In: Algorithms and Computation, 20th International Symposium, ISAAC 2009, Honolulu, Hawaii, USA, December 16-18, 2009. Proceedings, pp. 882-891, 2009, Springer, 978-3-642-10630-9. The full citation details ...](Pics/full.jpeg) |
2009 |
DBLP DOI BibTeX RDF |
|
43 | Mathias Weller, Christian Komusiewicz, Rolf Niedermeier, Johannes Uhlmann |
On Making Directed Graphs Transitive. ![Search on Bibsonomy](Pics/bibsonomy.png) |
WADS ![In: Algorithms and Data Structures, 11th International Symposium, WADS 2009, Banff, Canada, August 21-23, 2009. Proceedings, pp. 542-553, 2009, Springer, 978-3-642-03366-7. The full citation details ...](Pics/full.jpeg) |
2009 |
DBLP DOI BibTeX RDF |
|
43 | Noga Alon, Fedor V. Fomin, Gregory Z. Gutin, Michael Krivelevich, Saket Saurabh 0001 |
Better Algorithms and Bounds for Directed Maximum Leaf Problems. ![Search on Bibsonomy](Pics/bibsonomy.png) |
FSTTCS ![In: FSTTCS 2007: Foundations of Software Technology and Theoretical Computer Science, 27th International Conference, New Delhi, India, December 12-14, 2007, Proceedings, pp. 316-327, 2007, Springer, 978-3-540-77049-7. The full citation details ...](Pics/full.jpeg) |
2007 |
DBLP DOI BibTeX RDF |
|
43 | Aleksander Malnic, Dragan Marusic, Norbert Seifter, Boris Zgrablic |
Highly Arc-Transitive Digraphs With No Homomorphism Onto Z. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Comb. ![In: Comb. 22(3), pp. 435-443, 2002. The full citation details ...](Pics/full.jpeg) |
2002 |
DBLP DOI BibTeX RDF |
AMS Subject Classification (2000) Classes: 05C25, 05C20 |
40 | Arvind Gupta, Pavol Hell, Mehdi Karimi 0001, Arash Rafiey |
Minimum Cost Homomorphisms to Reflexive Digraphs. ![Search on Bibsonomy](Pics/bibsonomy.png) |
LATIN ![In: LATIN 2008: Theoretical Informatics, 8th Latin American Symposium, Búzios, Brazil, April 7-11, 2008, Proceedings, pp. 182-193, 2008, Springer, 978-3-540-78772-3. The full citation details ...](Pics/full.jpeg) |
2008 |
DBLP DOI BibTeX RDF |
minimum cost homomorphism, reflexive digraph, NP-completeness, polynomial time algorithm, homomorphism, dichotomy |
38 | Ikno Kim, Junzo Watada |
A Biologically Intelligent Encoding Approach to a Hierarchical Classification of Relational Elements in a Digraph. ![Search on Bibsonomy](Pics/bibsonomy.png) |
KES (2) ![In: Knowledge-Based and Intelligent Information and Engineering Systems, 13th International Conference, KES 2009, Santiago, Chile, September 28-30, 2009, Proceedings, Part II, pp. 174-180, 2009, Springer, 978-3-642-04591-2. The full citation details ...](Pics/full.jpeg) |
2009 |
DBLP DOI BibTeX RDF |
|
38 | Nadja Betzler, Johannes Uhlmann |
Parameterized Complexity of Candidate Control in Elections and Related Digraph Problems. ![Search on Bibsonomy](Pics/bibsonomy.png) |
COCOA ![In: Combinatorial Optimization and Applications, Second International Conference, COCOA 2008, St. John's, NL, Canada, August 21-24, 2008. Proceedings, pp. 43-53, 2008, Springer, 978-3-540-85096-0. The full citation details ...](Pics/full.jpeg) |
2008 |
DBLP DOI BibTeX RDF |
|
38 | Jin-Myung Won, Fakhreddine Karray |
A Genetic Algorithm with cycle representation and contraction digraph model for Guideway Network design of Personal Rapid Transit. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IEEE Congress on Evolutionary Computation ![In: Proceedings of the IEEE Congress on Evolutionary Computation, CEC 2007, 25-28 September 2007, Singapore, pp. 2405-2412, 2007, IEEE, 978-1-4244-1339-3. The full citation details ...](Pics/full.jpeg) |
2007 |
DBLP DOI BibTeX RDF |
|
38 | Peter Mahlmann, Christian Schindelhauer |
Distributed random digraph transformations for peer-to-peer networks. ![Search on Bibsonomy](Pics/bibsonomy.png) |
SPAA ![In: SPAA 2006: Proceedings of the 18th Annual ACM Symposium on Parallelism in Algorithms and Architectures, Cambridge, Massachusetts, USA, July 30 - August 2, 2006, pp. 308-317, 2006, ACM, 1-59593-452-9. The full citation details ...](Pics/full.jpeg) |
2006 |
DBLP DOI BibTeX RDF |
distributed algorithms, peer-to-peer networks, random graphs, expander graphs |
38 | Albert Atserias |
On Digraph Coloring Problems and Treewidth Duality. ![Search on Bibsonomy](Pics/bibsonomy.png) |
LICS ![In: 20th IEEE Symposium on Logic in Computer Science (LICS 2005), 26-29 June 2005, Chicago, IL, USA, Proceedings, pp. 106-115, 2005, IEEE Computer Society, 0-7695-2266-1. The full citation details ...](Pics/full.jpeg) |
2005 |
DBLP DOI BibTeX RDF |
|
38 | Ventsi G. Rumchev |
Positive Linear Systems Reachability Criterion in Digraph Form. ![Search on Bibsonomy](Pics/bibsonomy.png) |
POSTA ![In: Positive Systems, Proceedings of the First Multidisciplinary International Symposium on Positive Systems: Theory and Applications (POSTA 2003), Rome, Italy, August 28-30, 2003, pp. 241-248, 2003, Springer, 3-540-40342-6. The full citation details ...](Pics/full.jpeg) |
2003 |
DBLP DOI BibTeX RDF |
|
38 | András Frank, Tibor Jordán |
How to Make a Strongly Connected Digraph Two-Connected. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IPCO ![In: Integer Programming and Combinatorial Optimization, 4th International IPCO Conference, Copenhagen, Denmark, May 29-31, 1995, Proceedings, pp. 414-425, 1995, Springer, 3-540-59408-6. The full citation details ...](Pics/full.jpeg) |
1995 |
DBLP DOI BibTeX RDF |
|
38 | V. V. Dixit |
EDNA: Expert Digraph Network Analysis. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IEA/AIE (Vol. 1) ![In: Proceedings of the Third International Conference on Industrial and Engineering Applications of Artificial Intelligence and Expert Systems, IEA/AIE 1990, July 15-18, 1990, The Mills House Hotel, Charleston, SC, USA - Volume 1, pp. 70-75, 1990, ACM, 0-89791-372-8. The full citation details ...](Pics/full.jpeg) |
1990 |
DBLP DOI BibTeX RDF |
|
35 | Michael Lampis, Georgia Kaouri, Valia Mitsou |
On the Algorithmic Effectiveness of Digraph Decompositions and Complexity Measures. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ISAAC ![In: Algorithms and Computation, 19th International Symposium, ISAAC 2008, Gold Coast, Australia, December 15-17, 2008. Proceedings, pp. 220-231, 2008, Springer, 978-3-540-92181-3. The full citation details ...](Pics/full.jpeg) |
2008 |
DBLP DOI BibTeX RDF |
Digraph decompositions, Treewidth, Parameterized Complexity |
35 | Carles Padró, Paz Morillo, Miguel Angel Fiol |
Comments on "Line Digraph Iterations and Connectivity Analysis of de Bruijn and Kautz Graphs". ![Search on Bibsonomy](Pics/bibsonomy.png) |
IEEE Trans. Computers ![In: IEEE Trans. Computers 45(6), pp. 768, 1996. The full citation details ...](Pics/full.jpeg) |
1996 |
DBLP DOI BibTeX RDF |
diameter-vulnerability, line digraph iteration, fault-tolerance, Connectivity, spread |
35 | Ding-Zhu Du, Yuh-Dauh Lyuu, D. Frank Hsu |
Line Digraph Iterations and Connectivity Analysis of de Bruijn and Kautz Graphs. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IEEE Trans. Computers ![In: IEEE Trans. Computers 42(5), pp. 612-616, 1993. The full citation details ...](Pics/full.jpeg) |
1993 |
DBLP DOI BibTeX RDF |
de Bruijn digraphs, digraph iterations, connectivity analysis, optimal general theorem, optimal bounds, length-bound disjoint paths, graph theory, iterative methods, directed graphs, node-disjoint paths, Kautz graphs |
35 | Miguel Angel Fiol, Anna S. Lladó |
The Partial Line Digraph Technique in the Design of Large Interconnection Networks. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IEEE Trans. Computers ![In: IEEE Trans. Computers 41(7), pp. 848-857, 1992. The full citation details ...](Pics/full.jpeg) |
1992 |
DBLP DOI BibTeX RDF |
partial line digraph technique, large interconnection networks, maximum out-degree, Kautz digraphs, distributed systems, design, routing, connectivity, multiprocessor interconnection networks, directed graphs, expandability |
33 | Marcel Jackson, Tomasz Kowalski, Todd Niven |
Digraph related constructions and the complexity of digraph homomorphism problems ![Search on Bibsonomy](Pics/bibsonomy.png) |
CoRR ![In: CoRR abs/1304.4986, 2013. The full citation details ...](Pics/full.jpeg) |
2013 |
DBLP BibTeX RDF |
|
33 | Huiping Cai, Juan Liu 0001, Jixiang Meng |
Domination number in iterated line digraph of a complete bipartite digraph. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Ars Comb. ![In: Ars Comb. 107, pp. 515-520, 2012. The full citation details ...](Pics/full.jpeg) |
2012 |
DBLP BibTeX RDF |
|
33 | Stephan Kreutzer, Sebastian Ordyniak |
Digraph decompositions and monotonicity in digraph searching. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Theor. Comput. Sci. ![In: Theor. Comput. Sci. 412(35), pp. 4688-4703, 2011. The full citation details ...](Pics/full.jpeg) |
2011 |
DBLP DOI BibTeX RDF |
|
33 | Yuuki Tanaka, Yukio Shibata |
The Cayley digraph associated to the Kautz digraph. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Ars Comb. ![In: Ars Comb. 94, 2010. The full citation details ...](Pics/full.jpeg) |
2010 |
DBLP BibTeX RDF |
|
33 | Linda Marshall, Derrick G. Kourie |
Deriving a digraph isomorphism for digraph compliance measurement. ![Search on Bibsonomy](Pics/bibsonomy.png) |
SAICSIT ![In: Proceedings of the 2010 Annual Conference of the South African Institute of Computer Scientists and Information Technologists, SAICSIT 2010, Bela Bela, South Africa, October 11-13, 2010, pp. 160-169, 2010, ACM, 978-1-60558-950-3. The full citation details ...](Pics/full.jpeg) |
2010 |
DBLP DOI BibTeX RDF |
|
33 | Juan Liu 0001, Lin Sun, Jixiang Meng |
A line digraph of a complete bipartite digraph. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Appl. Math. Lett. ![In: Appl. Math. Lett. 22(4), pp. 544-547, 2009. The full citation details ...](Pics/full.jpeg) |
2009 |
DBLP DOI BibTeX RDF |
|
33 | Stephan Kreutzer, Sebastian Ordyniak |
Digraph Decompositions and Monotonicity in Digraph Searching ![Search on Bibsonomy](Pics/bibsonomy.png) |
CoRR ![In: CoRR abs/0802.2228, 2008. The full citation details ...](Pics/full.jpeg) |
2008 |
DBLP BibTeX RDF |
|
33 | Simone Severini |
On the structure of the adjacency matrix of the line digraph of a regular digraph. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Discret. Appl. Math. ![In: Discret. Appl. Math. 154(12), pp. 1763-1765, 2006. The full citation details ...](Pics/full.jpeg) |
2006 |
DBLP DOI BibTeX RDF |
|
33 | Camino Balbuena, Daniela Ferrero, Xavier Marcote, Ignacio M. Pelayo |
Algebraic properties of a digraph and its line digraph. ![Search on Bibsonomy](Pics/bibsonomy.png) |
J. Interconnect. Networks ![In: J. Interconnect. Networks 4(4), pp. 377-393, 2003. The full citation details ...](Pics/full.jpeg) |
2003 |
DBLP DOI BibTeX RDF |
|
33 | Fuji Zhang, Guoning Lin |
When a digraph and its line digraph are connected and cospectral. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Discret. Math. ![In: Discret. Math. 184(1-3), pp. 289-295, 1998. The full citation details ...](Pics/full.jpeg) |
1998 |
DBLP DOI BibTeX RDF |
|
33 | Doug Mahar, Renee Napier, Michael Wagner 0004, William Laverty, Ron Henderson, Michael Hiron |
Optimizing digraph-latency based biometric typist verification systems: inter and intra typist differences in digraph latency distributions. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Int. J. Hum. Comput. Stud. ![In: Int. J. Hum. Comput. Stud. 43(4), pp. 579-592, 1995. The full citation details ...](Pics/full.jpeg) |
1995 |
DBLP DOI BibTeX RDF |
|
33 | Masatosi Imori, Makoto Matsumoto, Hisao Yamada |
The line digraph of a regular and pancircular digraph is also regular and pancircular. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Graphs Comb. ![In: Graphs Comb. 4(1), pp. 235-239, 1988. The full citation details ...](Pics/full.jpeg) |
1988 |
DBLP DOI BibTeX RDF |
|
32 | Paul Balister, Stefanie Gerke, Gregory Z. Gutin |
Convex Sets in Acyclic Digraphs. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Order ![In: Order 26(1), pp. 95-100, 2009. The full citation details ...](Pics/full.jpeg) |
2009 |
DBLP DOI BibTeX RDF |
Acyclic diagraphs, Convex sets |
32 | Arnab Bhattacharyya 0001, Elena Grigorescu, Kyomin Jung, Sofya Raskhodnikova, David P. Woodruff |
Transitive-closure spanners. ![Search on Bibsonomy](Pics/bibsonomy.png) |
SODA ![In: Proceedings of the Twentieth Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2009, New York, NY, USA, January 4-6, 2009, pp. 932-941, 2009, SIAM, 978-0-89871-680-1. The full citation details ...](Pics/full.jpeg) |
2009 |
DBLP DOI BibTeX RDF |
|
32 | Tamara Mchedlidze, Antonios Symvonis |
Crossing-Optimal Acyclic Hamiltonian Path Completion and Its Application to Upward Topological Book Embeddings. ![Search on Bibsonomy](Pics/bibsonomy.png) |
WALCOM ![In: WALCOM: Algorithms and Computation, Third International Workshop, WALCOM 2009, Kolkata, India, February 18-20, 2009. Proceedings, pp. 250-261, 2009, Springer, 978-3-642-00201-4. The full citation details ...](Pics/full.jpeg) |
2009 |
DBLP DOI BibTeX RDF |
|
32 | Tamara Mchedlidze, Antonios Symvonis |
Crossing-Optimal Acyclic HP-Completion for Outerplanar st-Digraphs. ![Search on Bibsonomy](Pics/bibsonomy.png) |
COCOON ![In: Computing and Combinatorics, 15th Annual International Conference, COCOON 2009, Niagara Falls, NY, USA, July 13-15, 2009, Proceedings, pp. 76-85, 2009, Springer, 978-3-642-02881-6. The full citation details ...](Pics/full.jpeg) |
2009 |
DBLP DOI BibTeX RDF |
|
32 | Daniel Lokshtanov, Venkatesh Raman 0001, Saket Saurabh 0001, Somnath Sikdar |
On the Directed Degree-Preserving Spanning Tree Problem. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IWPEC ![In: Parameterized and Exact Computation, 4th International Workshop, IWPEC 2009, Copenhagen, Denmark, September 10-11, 2009, Revised Selected Papers, pp. 276-287, 2009, Springer, 978-3-642-11268-3. The full citation details ...](Pics/full.jpeg) |
2009 |
DBLP DOI BibTeX RDF |
|
32 | Raymond Bisdorff, Patrick Meyer, Marc Roubens |
R UBIS : a bipolar-valued outranking method for the choice problem. ![Search on Bibsonomy](Pics/bibsonomy.png) |
4OR ![In: 4OR 6(2), pp. 143-165, 2008. The full citation details ...](Pics/full.jpeg) |
2008 |
DBLP DOI BibTeX RDF |
MSC Classification (2000) 05C20, 90B50 |
32 | Bhavani Shankar, Prasant Gopal, Kannan Srinathan, C. Pandu Rangan |
Unconditionally reliable message transmission in directed networks. ![Search on Bibsonomy](Pics/bibsonomy.png) |
SODA ![In: Proceedings of the Nineteenth Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2008, San Francisco, California, USA, January 20-22, 2008, pp. 1048-1055, 2008, SIAM. The full citation details ...](Pics/full.jpeg) |
2008 |
DBLP BibTeX RDF |
|
32 | Aimal Rextin, Patrick Healy |
A Fully Dynamic Algorithm to Test the Upward Planarity of Single-Source Embedded Digraphs. ![Search on Bibsonomy](Pics/bibsonomy.png) |
GD ![In: Graph Drawing, 16th International Symposium, GD 2008, Heraklion, Crete, Greece, September 21-24, 2008. Revised Papers, pp. 254-265, 2008, Springer, 978-3-642-00218-2. The full citation details ...](Pics/full.jpeg) |
2008 |
DBLP DOI BibTeX RDF |
|
32 | Francesco Giordano, Giuseppe Liotta, Tamara Mchedlidze, Antonios Symvonis |
Computing Upward Topological Book Embeddings of Upward Planar Digraphs. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ISAAC ![In: Algorithms and Computation, 18th International Symposium, ISAAC 2007, Sendai, Japan, December 17-19, 2007, Proceedings, pp. 172-183, 2007, Springer, 978-3-540-77118-0. The full citation details ...](Pics/full.jpeg) |
2007 |
DBLP DOI BibTeX RDF |
|
32 | Daniela Ferrero |
Some properties of superline digraphs. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ITNG ![In: Fourth International Conference on Information Technology: New Generations (ITNG 2007), 2-4 April 2007, Las Vegas, Nevada, USA, pp. 1073-1076, 2007, IEEE Computer Society, 978-0-7695-2776-5. The full citation details ...](Pics/full.jpeg) |
2007 |
DBLP DOI BibTeX RDF |
|
32 | Farshad Rum, Brandon W. Gordon, Mohammad Eghtesad |
Consensus in Noisy Switching Directed Networks with Time-Delays. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ICNSC ![In: Proceedings of the IEEE International Conference on Networking, Sensing and Control, ICNSC 2007, London, UK, 15-17 April 2007, pp. 431-436, 2007, IEEE, 1-4244-1076-2. The full citation details ...](Pics/full.jpeg) |
2007 |
DBLP DOI BibTeX RDF |
|
32 | Yangjun Chen, Donovan Cooke |
On the transitive closure representation and adjustable compression. ![Search on Bibsonomy](Pics/bibsonomy.png) |
SAC ![In: Proceedings of the 2006 ACM Symposium on Applied Computing (SAC), Dijon, France, April 23-27, 2006, pp. 450-455, 2006, ACM, 1-59593-108-2. The full citation details ...](Pics/full.jpeg) |
2006 |
DBLP DOI BibTeX RDF |
databases, directed acyclic graphs, transitive closures, graph decomposition, branchings, topological order |
32 | Saverio Caminiti, Rossella Petreschi |
String Coding of Trees with Locality and Heritability. ![Search on Bibsonomy](Pics/bibsonomy.png) |
COCOON ![In: Computing and Combinatorics, 11th Annual International Conference, COCOON 2005, Kunming, China, August 16-29, 2005, Proceedings, pp. 251-262, 2005, Springer, 3-540-28061-8. The full citation details ...](Pics/full.jpeg) |
2005 |
DBLP DOI BibTeX RDF |
|
32 | Weizhen Gu, Xingde Jia |
On a Traffic Control Problem. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ISPAN ![In: 8th International Symposium on Parallel Architectures, Algorithms, and Networks, ISPAN 2005, December 7-9. 2005, Las Vegas, Nevada, USA, pp. 510-515, 2005, IEEE Computer Society, 0-7695-2509-1. The full citation details ...](Pics/full.jpeg) |
2005 |
DBLP DOI BibTeX RDF |
|
32 | Abraham Flaxman, Alan M. Frieze |
The Diameter of Randomly Perturbed Digraphs and Some Applications.. ![Search on Bibsonomy](Pics/bibsonomy.png) |
APPROX-RANDOM ![In: Approximation, Randomization, and Combinatorial Optimization, Algorithms and Techniques, 7th International Workshop on Approximation Algorithms for Combinatorial Optimization Problems, APPROX 2004, and 8th International Workshop on Randomization and Computation, RANDOM 2004, Cambridge, MA, USA, August 22-24, 2004, Proceedings, pp. 345-356, 2004, Springer, 3-540-22894-2. The full citation details ...](Pics/full.jpeg) |
2004 |
DBLP DOI BibTeX RDF |
|
32 | Carlos E. R. Alves, Edson Cáceres, Amaury Antônio de Castro Jr., Siang W. Song, Jayme Luiz Szwarcfiter |
Efficient Parallel Implementation of Transitive Closure of Digraphs. ![Search on Bibsonomy](Pics/bibsonomy.png) |
PVM/MPI ![In: Recent Advances in Parallel Virtual Machine and Message Passing Interface,10th European PVM/MPI Users' Group Meeting, Venice, Italy, September 29 - October 2, 2003, Proceedings, pp. 126-133, 2003, Springer, 3-540-20149-1. The full citation details ...](Pics/full.jpeg) |
2003 |
DBLP DOI BibTeX RDF |
|
32 | Robert E. Jamison |
Transforming Toric Digraphs. ![Search on Bibsonomy](Pics/bibsonomy.png) |
AGTIVE ![In: Applications of Graph Transformations with Industrial Relevance, Second International Workshop, AGTIVE 2003, Charlottesville, VA, USA, September 27 - October 1, 2003, Revised Selected and Invited Papers, pp. 328-333, 2003, Springer, 3-540-22120-4. The full citation details ...](Pics/full.jpeg) |
2003 |
DBLP DOI BibTeX RDF |
|
32 | Sven Hartmann |
Orthogonal Decompositions of Complete Digraphs. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Graphs Comb. ![In: Graphs Comb. 18(2), pp. 285-302, 2002. The full citation details ...](Pics/full.jpeg) |
2002 |
DBLP DOI BibTeX RDF |
|
32 | Gregory Z. Gutin, Anders Yeo |
Solution of a Conjecture of Volkmann on the Number of Vertices in Longest Paths and Cycles of Strong Semicomplete Multipartite Digraphs. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Graphs Comb. ![In: Graphs Comb. 17(3), pp. 473-477, 2001. The full citation details ...](Pics/full.jpeg) |
2001 |
DBLP DOI BibTeX RDF |
|
32 | Romeo Rizzi |
Excluding a Simple Good Pair Approach to Directed Cuts. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Graphs Comb. ![In: Graphs Comb. 17(4), pp. 741-744, 2001. The full citation details ...](Pics/full.jpeg) |
2001 |
DBLP DOI BibTeX RDF |
|
32 | Bertrand Guenin |
Circuit Mengerian Directed Graphs. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IPCO ![In: Integer Programming and Combinatorial Optimization, 8th International IPCO Conference, Utrecht, The Netherlands, June 13-15, 2001, Proceedings, pp. 185-195, 2001, Springer, 3-540-42225-0. The full citation details ...](Pics/full.jpeg) |
2001 |
DBLP DOI BibTeX RDF |
|
32 | Sounaka Mishra, Kripasindhu Sikdar |
On the Hardness of Approximating Some NP-optimization Problems Related to Minimum Linear Ordering Problem. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IFIP TCS ![In: Theoretical Computer Science, Exploring New Frontiers of Theoretical Informatics, International Conference IFIP TCS 2000, Sendai, Japan, August 17-19, 2000, Proceedings, pp. 186-199, 2000, Springer, 3-540-67823-9. The full citation details ...](Pics/full.jpeg) |
2000 |
DBLP DOI BibTeX RDF |
NP-optimization problems, Minimaximal and maximinimal NP-optimization problems, L-reduction, Approximation algorithms, Hardness of approximation, APX-hardness |
32 | Claus-Peter Schnorr, C. R. Subramanian 0001 |
Almost Optimal (on the average) Combinatorial Algorithms for Boolean Matrix Product Witnesses, Computing the Diameter (Extended Abstract). ![Search on Bibsonomy](Pics/bibsonomy.png) |
RANDOM ![In: Randomization and Approximation Techniques in Computer Science, Second International Workshop, RANDOM'98, Barcelona, Spain, October 8-10, 1998, Proceedings, pp. 218-231, 1998, Springer, 3-540-65142-X. The full citation details ...](Pics/full.jpeg) |
1998 |
DBLP DOI BibTeX RDF |
|
32 | Erich Prisner |
Bicliques in Graphs II: Recognizing k-Path Graphs and Underlying Graphs of Line Digraphs. ![Search on Bibsonomy](Pics/bibsonomy.png) |
WG ![In: Graph-Theoretic Concepts in Computer Science, 23rd International Workshop, WG '97, Berlin, Germany, June 18-20, 1997, Proceedings, pp. 273-287, 1997, Springer, 3-540-63757-5. The full citation details ...](Pics/full.jpeg) |
1997 |
DBLP DOI BibTeX RDF |
|
32 | Hermann Stamm |
On Feedback Problems in Planar Digraphs. ![Search on Bibsonomy](Pics/bibsonomy.png) |
WG ![In: Graph-Theoretic Concepts in Computer Science, 16rd International Workshop, WG '90, Berlin, Germany, June 20-22, 1990, Proceedings, pp. 79-89, 1990, Springer, 3-540-53832-1. The full citation details ...](Pics/full.jpeg) |
1990 |
DBLP DOI BibTeX RDF |
|
32 | F. Evans, Jan Jantzen |
A Structured Approach to Analysis and Design of Complex Systems. ![Search on Bibsonomy](Pics/bibsonomy.png) |
APL ![In: Conference Proceedings on APL 90: For the Future, APL 1990, Copenhagen, Denmark, August 13-17, 1990., pp. 104, 1990, ACM, 0-89791-371-X. The full citation details ...](Pics/full.jpeg) |
1990 |
DBLP DOI BibTeX RDF |
APL |
32 | Ewald Speckenmeyer |
On Feedback Problems in Diagraphs. ![Search on Bibsonomy](Pics/bibsonomy.png) |
WG ![In: Graph-Theoretic Concepts in Computer Science, 15th International Workshop, WG '89, Castle Rolduc, The Netherlands, June 14-16, 1989, Proceedings, pp. 218-231, 1989, Springer, 3-540-52292-1. The full citation details ...](Pics/full.jpeg) |
1989 |
DBLP DOI BibTeX RDF |
|
32 | Jan Jantzen |
Inference Planning Using Digraphs and Boolean Arrays. ![Search on Bibsonomy](Pics/bibsonomy.png) |
APL ![In: Conference Proceedings on APL as a Tool of Thought, APL 1989, New York City, NY, USA, August 7-10, 1989., pp. 200-204, 1989, ACM, 0-89791-327-2. The full citation details ...](Pics/full.jpeg) |
1989 |
DBLP DOI BibTeX RDF |
APL |
29 | Boting Yang, Yi Cao |
Standard directed search strategies and their applications. ![Search on Bibsonomy](Pics/bibsonomy.png) |
J. Comb. Optim. ![In: J. Comb. Optim. 17(4), pp. 378-399, 2009. The full citation details ...](Pics/full.jpeg) |
2009 |
DBLP DOI BibTeX RDF |
Oriented grids, Pursuit-evasion problem, Digraph, Directed search |
29 | Réka Albert, Bhaskar DasGupta, Riccardo Dondi, Eduardo D. Sontag |
Inferring (Biological) Signal Transduction Networks via Transitive Reductions of Directed Graphs. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Algorithmica ![In: Algorithmica 51(2), pp. 129-159, 2008. The full citation details ...](Pics/full.jpeg) |
2008 |
DBLP DOI BibTeX RDF |
Transitive reduction of directed graphs, Minimum equivalent digraph, (Biological) signal transduction networks, Approximation algorithms |
29 | Deqiang Chen, Jie Zheng, Xiaoqian Wu |
Computer Simulation and Word-Updating Dynamical Systems (WDS) on Digraphs. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ICIC (2) ![In: Advanced Intelligent Computing Theories and Applications. With Aspects of Artificial Intelligence, 4th International Conference on Intelligent Computing, ICIC 2008, Shanghai, China, September 15-18, 2008, Proceedings, pp. 209-216, 2008, Springer, 978-3-540-85983-3. The full citation details ...](Pics/full.jpeg) |
2008 |
DBLP DOI BibTeX RDF |
Word-updating Dynamical System (WDS), S-pseud Independent Set, Functional Digraph |
29 | Wei Meng, Shengjia Li |
Semicomplete Multipartite Digraphs Whose Every Arc Is Contained in a Hamiltonian Path. ![Search on Bibsonomy](Pics/bibsonomy.png) |
International Conference on Computational Science (3) ![In: Computational Science - ICCS 2007, 7th International Conference, Beijing, China, May 27 - 30, 2007, Proceedings, Part III, pp. 299-304, 2007, Springer, 978-3-540-72587-9. The full citation details ...](Pics/full.jpeg) |
2007 |
DBLP DOI BibTeX RDF |
Semicomplete multipartite digraph, Semi-partition complete digraphs, Hamiltonian paths |
29 | Mao-cheng Cai, Xiaotie Deng, Lusheng Wang 0001 |
Minimum k Arborescences with Bandwidth Constraints. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Algorithmica ![In: Algorithmica 38(4), pp. 529-537, 2004. The full citation details ...](Pics/full.jpeg) |
2004 |
DBLP DOI BibTeX RDF |
Arborescence, Polymatroid intersection, Algorithm and complexity, Maximum flow, Matroid, Digraph, Polymatroid |
29 | Appu Muthusamy |
On Resolvable Multipartite G-Designs. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Graphs Comb. ![In: Graphs Comb. 20(3), pp. 377-382, 2004. The full citation details ...](Pics/full.jpeg) |
2004 |
DBLP DOI BibTeX RDF |
Cycle-factorization, Wreath product of graphs, Complete symmetric k-partite multi-digraph, Resesolvable multipartite G-design |
29 | Miika Silfverberg, I. Scott MacKenzie, Panu Korhonen |
Predicting text entry speed on mobile phones. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CHI ![In: Proceedings of the CHI 2000 Conference on Human factors in computing systems, The Hague, The Netherlands, April 1-6, 2000., pp. 9-16, 2000, ACM, 1-58113-216-6. The full citation details ...](Pics/full.jpeg) |
2000 |
DBLP DOI BibTeX RDF |
digraph frequencies, mobile phones, text entry, Fitts' law, mobile systems, human performance modeling, keypad input |
29 | 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 |
29 | Hannah Honghua Yang, D. F. Wong 0001 |
New algorithms for min-cut replication in partitioned circuits. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ICCAD ![In: Proceedings of the 1995 IEEE/ACM International Conference on Computer-Aided Design, ICCAD 1995, San Jose, California, USA, November 5-9, 1995, pp. 216-222, 1995, IEEE Computer Society / ACM, 0-8186-7213-7. The full citation details ...](Pics/full.jpeg) |
1995 |
DBLP DOI BibTeX RDF |
Hyper-MAMC, VLSI circuit partitioning, k-way partition, k-way partitioned digraph, min-cut replication, partitioned circuits, VLSI, optimal algorithm, circuit layout CAD, hypergraphs, VLSI layout, digraphs, circuit layout |
29 | Ernst W. Mayr |
Scheduling interval orders in parallel. ![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. 20-28, 1995, IEEE Computer Society, 0-8186-6945-4. The full citation details ...](Pics/full.jpeg) |
1995 |
DBLP DOI BibTeX RDF |
interval order scheduling, interval representations, transitively oriented digraph, undirected chordal complement, identical parallel processors, minimal length schedule, scheduling distance computation subroutine, incremental version, empty slots, interval order precedence constraints, scheduling, parallel algorithms, parallel algorithm, computational complexity, concurrency control, directed graphs, partial orders, NP-complete problems, deadlines, execution time, minimisation, interval graphs, optimal schedule, release times, NC-algorithm, CREW-PRAM, task systems |
27 | Hermann Gruber, Markus Holzer 0001 |
Finite Automata, Digraph Connectivity, and Regular Expression Size. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ICALP (2) ![In: Automata, Languages and Programming, 35th International Colloquium, ICALP 2008, Reykjavik, Iceland, July 7-11, 2008, Proceedings, Part II - Track B: Logic, Semantics, and Theory of Programming & Track C: Security and Cryptography Foundations, pp. 39-50, 2008, Springer, 978-3-540-70582-6. The full citation details ...](Pics/full.jpeg) |
2008 |
DBLP DOI BibTeX RDF |
|
27 | Gregory Z. Gutin, Adrian Johnstone, Joseph Reddington, Elizabeth Scott, Anders Yeo |
An Algorithm for Finding Input-Output Constrained Convex Sets in an Acyclic Digraph. ![Search on Bibsonomy](Pics/bibsonomy.png) |
WG ![In: Graph-Theoretic Concepts in Computer Science, 34th International Workshop, WG 2008, Durham, UK, June 30 - July 2, 2008. Revised Papers, pp. 206-217, 2008, 978-3-540-92247-6. The full citation details ...](Pics/full.jpeg) |
2008 |
DBLP DOI BibTeX RDF |
|
27 | Jud Leonard, Avi Purkayastha, Matt Reilly, Tushar Mohan |
The software interface for a cluster interconnect based on the Kautz digraph. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CLUSTER ![In: Proceedings of the 2007 IEEE International Conference on Cluster Computing, 17-20 September 2007, Austin, Texas, USA, pp. 187-193, 2007, IEEE Computer Society, 978-1-4244-1387-4. The full citation details ...](Pics/full.jpeg) |
2007 |
DBLP DOI BibTeX RDF |
|
27 | János Barát |
Directed Path-width and Monotonicity in Digraph Searching. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Graphs Comb. ![In: Graphs Comb. 22(2), pp. 161-172, 2006. The full citation details ...](Pics/full.jpeg) |
2006 |
DBLP DOI BibTeX RDF |
Search games, Path-width, Cops-and-robber games, Directed graph, Monotonicity |
27 | E. M. Kelly, Lisa M. Bartlett |
Application of the Digraph Method in System Fault Diagnostics. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ARES ![In: Proceedings of the The First International Conference on Availability, Reliability and Security, ARES 2006, The International Dependability Conference - Bridging Theory and Practice, April 20-22 2006, Vienna University of Technology, Austria, pp. 693-700, 2006, IEEE Computer Society, 0-7695-2567-9. The full citation details ...](Pics/full.jpeg) |
2006 |
DBLP DOI BibTeX RDF |
Fault Diagnosis, Availability, Failure Detection, Digraphs |
27 | Rudolf Müller, Andreas S. Schulz |
The Interval Order Polytope of a Digraph. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IPCO ![In: Integer Programming and Combinatorial Optimization, 4th International IPCO Conference, Copenhagen, Denmark, May 29-31, 1995, Proceedings, pp. 50-64, 1995, Springer, 3-540-59408-6. The full citation details ...](Pics/full.jpeg) |
1995 |
DBLP DOI BibTeX RDF |
|
27 | Klaus Simon, Davide Crippa, Fabian Collenberg |
On the Distribution of the Transitive Closure in a Random Acyclic Digraph. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ESA ![In: Algorithms - ESA '93, First Annual European Symposium, Bad Honnef, Germany, September 30 - October 2, 1993, Proceedings, pp. 345-356, 1993, Springer, 3-540-57273-2. The full citation details ...](Pics/full.jpeg) |
1993 |
DBLP DOI BibTeX RDF |
|
27 | Paola Bertolazzi, Robert F. Cohen, Giuseppe Di Battista, Roberto Tamassia, Ioannis G. Tollis |
How to Draw a Series-Parallel Digraph (Extended Abstract). ![Search on Bibsonomy](Pics/bibsonomy.png) |
SWAT ![In: Algorithm Theory - SWAT '92, Third Scandinavian Workshop on Algorithm Theory, Helsinki, Finland, July 8-10, 1992, Proceedings, pp. 272-283, 1992, Springer, 3-540-55706-7. The full citation details ...](Pics/full.jpeg) |
1992 |
DBLP DOI BibTeX RDF |
|
27 | Paul G. Spirakis, Athanasios K. Tsakalidis |
A Very Fast, Practical Algorithm for Finding a Negative Cycle in a Digraph. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ICALP ![In: Automata, Languages and Programming, 13th International Colloquium, ICALP86, Rennes, France, July 15-19, 1986, Proceedings, pp. 397-406, 1986, Springer, 3-540-16761-7. The full citation details ...](Pics/full.jpeg) |
1986 |
DBLP DOI BibTeX RDF |
|
21 | Sarmad Abbasi, Patrick Healy, Aimal Rextin |
An Improved Upward Planarity Testing Algorithm and Related Applications. ![Search on Bibsonomy](Pics/bibsonomy.png) |
WALCOM ![In: WALCOM: Algorithms and Computation, Third International Workshop, WALCOM 2009, Kolkata, India, February 18-20, 2009. Proceedings, pp. 334-344, 2009, Springer, 978-3-642-00201-4. The full citation details ...](Pics/full.jpeg) |
2009 |
DBLP DOI BibTeX RDF |
|
21 | Marc Christie, Fabrice Lamarche, Frédéric Benhamou |
A Spatio-temporal Reasoning System for Virtual Camera Planning. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Smart Graphics ![In: Smart Graphics, 9th International Symposium, SG 2009, Salamanca, Spain, May 28-30, 2009. Proceedings, pp. 119-127, 2009, Springer, 978-3-642-02114-5. The full citation details ...](Pics/full.jpeg) |
2009 |
DBLP DOI BibTeX RDF |
|
21 | Prasad Chebolu, Alan M. Frieze, Páll Melsted, Gregory B. Sorkin |
Average-Case Analyses of Vickrey Costs. ![Search on Bibsonomy](Pics/bibsonomy.png) |
APPROX-RANDOM ![In: Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques, 12th International Workshop, APPROX 2009, and 13th International Workshop, RANDOM 2009, Berkeley, CA, USA, August 21-23, 2009. Proceedings, pp. 434-447, 2009, Springer, 978-3-642-03684-2. The full citation details ...](Pics/full.jpeg) |
2009 |
DBLP DOI BibTeX RDF |
VCG auction, Random Assignment Problem, shortest path, minimum spanning tree, random graph, Average-case analysis, MST |
21 | Nathann Cohen, Fedor V. Fomin, Gregory Z. Gutin, Eun Jung Kim 0002, Saket Saurabh 0001, Anders Yeo |
Algorithm for Finding k-Vertex Out-trees and Its Application to k-Internal Out-branching Problem. ![Search on Bibsonomy](Pics/bibsonomy.png) |
COCOON ![In: Computing and Combinatorics, 15th Annual International Conference, COCOON 2009, Niagara Falls, NY, USA, July 13-15, 2009, Proceedings, pp. 37-46, 2009, Springer, 978-3-642-02881-6. The full citation details ...](Pics/full.jpeg) |
2009 |
DBLP DOI BibTeX RDF |
|
21 | Sergey Kitaev, Steve Seif |
Word Problem of the Perkins Semigroup via Directed Acyclic Graphs. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Order ![In: Order 25(3), pp. 177-194, 2008. The full citation details ...](Pics/full.jpeg) |
2008 |
DBLP DOI BibTeX RDF |
Perkins semigroup, Free semigroup, Computational complexity -, Directed acyclic graph, Poset, Partially order set, Word problem |
21 | Satoru Iwata 0001, Takuro Matsuda |
Finding coherent cyclic orders in strong digraphs. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Comb. ![In: Comb. 28(1), pp. 83-88, 2008. The full citation details ...](Pics/full.jpeg) |
2008 |
DBLP DOI BibTeX RDF |
Mathematics Subject Classification (2000) 05C20, 90C27 |
Displaying result #1 - #100 of 893 (100 per page; Change: ) Pages: [ 1][ 2][ 3][ 4][ 5][ 6][ 7][ 8][ 9][ >>] |
|