Hits ?▲ |
Authors |
Title |
Venue |
Year |
Link |
Author keywords |
104 | Yosuke Kikuchi, Yukio Shibata |
On the Domination Numbers of Generalized de Bruijn Digraphs and Generalized Kautz Digraphs. ![Search on Bibsonomy](Pics/bibsonomy.png) |
COCOON ![In: Computing and Combinatorics, 7th Annual International Conference, COCOON 2001, Guilin, China, August 20-23, 2001, Proceedings, pp. 400-408, 2001, Springer, 3-540-42494-6. The full citation details ...](Pics/full.jpeg) |
2001 |
DBLP DOI BibTeX RDF |
|
81 | Hristo N. Djidjev |
On-Line Algorithms for Shortest Path Problems on Planar Digraphs. ![Search on Bibsonomy](Pics/bibsonomy.png) |
WG ![In: Graph-Theoretic Concepts in Computer Science, 22nd International Workshop, WG '96, Cadenabbia (Como), Italy, June 12-14, 1996, Proceedings, pp. 151-165, 1996, Springer, 3-540-62559-3. The full citation details ...](Pics/full.jpeg) |
1996 |
DBLP DOI BibTeX RDF |
|
69 | Arvind Gupta, Mehdi Karimi 0001, Eun Jung Kim 0002, Arash Rafiey |
Minimum Cost Homomorphism Dichotomy for Locally In-Semicomplete Digraphs. ![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. 374-383, 2008, Springer, 978-3-540-85096-0. The full citation details ...](Pics/full.jpeg) |
2008 |
DBLP DOI BibTeX RDF |
|
69 | 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 |
|
69 | 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 |
59 | Erik D. Demaine, Gregory Z. Gutin, Dániel Marx, Ulrike Stege |
07281 Open Problems -- Structure Theory and FPT Algorithmcs for Graphs, Digraphs and Hypergraphs. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Structure Theory and FPT Algorithmics for Graphs, Digraphs and Hypergraphs ![In: Structure Theory and FPT Algorithmics for Graphs, Digraphs and Hypergraphs, 08.07. - 13.07.2007, 2007, Internationales Begegnungs- und Forschungszentrum fuer Informatik (IBFI), Schloss Dagstuhl, Germany. The full citation details ...](Pics/full.jpeg) |
2007 |
DBLP BibTeX RDF |
|
59 | Erik D. Demaine, Gregory Z. Gutin, Dániel Marx, Ulrike Stege |
07281 Abstracts Collection -- Structure Theory and FPT Algorithmics for Graphs, Digraphs and Hypergraphs. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Structure Theory and FPT Algorithmics for Graphs, Digraphs and Hypergraphs ![In: Structure Theory and FPT Algorithmics for Graphs, Digraphs and Hypergraphs, 08.07. - 13.07.2007, 2007, Internationales Begegnungs- und Forschungszentrum fuer Informatik (IBFI), Schloss Dagstuhl, Germany. The full citation details ...](Pics/full.jpeg) |
2007 |
DBLP BibTeX RDF |
|
58 | Irith Ben-Arroyo Hartman |
On Path Partitions and Colourings in Digraphs. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Graph Theory, Computational Intelligence and Thought ![In: Graph Theory, Computational Intelligence and Thought, Essays Dedicated to Martin Charles Golumbic on the Occasion of His 60th Birthday, pp. 134-143, 2009, Springer, 978-3-642-02028-5. The full citation details ...](Pics/full.jpeg) |
2009 |
DBLP DOI BibTeX RDF |
|
58 | Terence Sim, Rajkumar Janakiraman |
Are Digraphs Good for Free-Text Keystroke Dynamics? ![Search on Bibsonomy](Pics/bibsonomy.png) |
CVPR ![In: 2007 IEEE Computer Society Conference on Computer Vision and Pattern Recognition (CVPR 2007), 18-23 June 2007, Minneapolis, Minnesota, USA, 2007, IEEE Computer Society, 1-4244-1179-3. The full citation details ...](Pics/full.jpeg) |
2007 |
DBLP DOI BibTeX RDF |
|
58 | Emilio Di Giacomo, Walter Didimo, Giuseppe Liotta, Stephen K. Wismath |
Book Embeddability of Series-Parallel Digraphs. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Algorithmica ![In: Algorithmica 45(4), pp. 531-547, 2006. The full citation details ...](Pics/full.jpeg) |
2006 |
DBLP DOI BibTeX RDF |
Book embeddability, Point set embedding |
58 | Michael Sampels |
On Generalized Moore Digraphs. ![Search on Bibsonomy](Pics/bibsonomy.png) |
PPAM ![In: Parallel Processing and Applied Mathematics, 5th International Conference, PPAM 2003, Czestochowa, Poland, September 7-10, 2003. Revised Papers, pp. 42-49, 2003, Springer, 3-540-21946-3. The full citation details ...](Pics/full.jpeg) |
2003 |
DBLP DOI BibTeX RDF |
|
58 | 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 |
58 | Giuseppe Di Battista, Roberto Tamassia |
Upward Drawings of Acyclic Digraphs. ![Search on Bibsonomy](Pics/bibsonomy.png) |
WG ![In: Graph-Theoretic Concepts in Computer Science, International Workshop, WG '87, Kloster Banz/Staffelstein, Germany, June 29 - July 1, 1987, Proceedings, pp. 121-133, 1987, Springer, 3-540-19422-3. The full citation details ...](Pics/full.jpeg) |
1987 |
DBLP DOI BibTeX RDF |
|
57 | Xingde Jia |
Wide Diameter of Cayley Digraphs of Finite Cyclic Groups. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ISPAN ![In: 9th International Symposium on Parallel Architectures, Algorithms, and Networks, ISPAN 2008, 7-9 May 2008, Sydney, NSW, Australia, pp. 146-150, 2008, IEEE Computer Society, 978-0-7695-3125-0. The full citation details ...](Pics/full.jpeg) |
2008 |
DBLP DOI BibTeX RDF |
Cayley digraphs, communication networks, wide diameter, geometric representation |
57 | 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 |
57 | Aviezri S. Fraenkel, Ofer Rahat |
Infinite Cyclic Impartial Games. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Computers and Games ![In: Computers and Games, First International Conference, CG'98, Tsukuba, Japan, November 11-12, 1998, Proceedings, pp. 212-221, 1998, Springer, 3-540-65766-5. The full citation details ...](Pics/full.jpeg) |
1998 |
DBLP DOI BibTeX RDF |
infinite cyclic games, locally path-bounded digraphs, generalized Sprague-Grundy function |
56 | Nathalie Homobono, Claudine Peyrat |
Connectivity of Imase and Itoh Digraphs. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IEEE Trans. Computers ![In: IEEE Trans. Computers 37(11), pp. 1459-1461, 1988. The full citation details ...](Pics/full.jpeg) |
1988 |
DBLP DOI BibTeX RDF |
Itoh digraphs, interconnection networks, fault tolerant computing, multiprocessor interconnection networks, directed graphs, digraphs |
47 | Erik D. Demaine, Gregory Z. Gutin, Dániel Marx, Ulrike Stege (eds.) |
Structure Theory and FPT Algorithmics for Graphs, Digraphs and Hypergraphs, 08.07. - 13.07.2007 ![Search on Bibsonomy](Pics/bibsonomy.png) |
Structure Theory and FPT Algorithmics for Graphs, Digraphs and Hypergraphs ![Internationales Begegnungs- und Forschungszentrum fuer Informatik (IBFI), Schloss Dagstuhl, Germany The full citation details ...](Pics/full.jpeg) |
2007 |
DBLP BibTeX RDF |
|
47 | Daniel Raible 0001, Henning Fernau |
Exact Elimination of Cycles in Graphs. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Structure Theory and FPT Algorithmics for Graphs, Digraphs and Hypergraphs ![In: Structure Theory and FPT Algorithmics for Graphs, Digraphs and Hypergraphs, 08.07. - 13.07.2007, 2007, Internationales Begegnungs- und Forschungszentrum fuer Informatik (IBFI), Schloss Dagstuhl, Germany. The full citation details ...](Pics/full.jpeg) |
2007 |
DBLP BibTeX RDF |
|
47 | Igor Razgon, Barry O'Sullivan |
Directed Feedback Vertex Set is Fixed-Parameter Tractable. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Structure Theory and FPT Algorithmics for Graphs, Digraphs and Hypergraphs ![In: Structure Theory and FPT Algorithmics for Graphs, Digraphs and Hypergraphs, 08.07. - 13.07.2007, 2007, Internationales Begegnungs- und Forschungszentrum fuer Informatik (IBFI), Schloss Dagstuhl, Germany. The full citation details ...](Pics/full.jpeg) |
2007 |
DBLP BibTeX RDF |
|
47 | Iris van Rooij, Matthew Hamilton, Moritz Müller, Todd Wareham |
Approximating Solution Structure. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Structure Theory and FPT Algorithmics for Graphs, Digraphs and Hypergraphs ![In: Structure Theory and FPT Algorithmics for Graphs, Digraphs and Hypergraphs, 08.07. - 13.07.2007, 2007, Internationales Begegnungs- und Forschungszentrum fuer Informatik (IBFI), Schloss Dagstuhl, Germany. The full citation details ...](Pics/full.jpeg) |
2007 |
DBLP BibTeX RDF |
|
47 | Jianer Chen, Yang Liu 0002, Songjian Lu |
Directed Feedback Vertex Set Problem is FPT. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Structure Theory and FPT Algorithmics for Graphs, Digraphs and Hypergraphs ![In: Structure Theory and FPT Algorithmics for Graphs, Digraphs and Hypergraphs, 08.07. - 13.07.2007, 2007, Internationales Begegnungs- und Forschungszentrum fuer Informatik (IBFI), Schloss Dagstuhl, Germany. The full citation details ...](Pics/full.jpeg) |
2007 |
DBLP BibTeX RDF |
|
46 | 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 |
46 | Domingo Gómez-Pérez, Jaime Gutierrez 0001, Álvar Ibeas |
Circulant Digraphs and Monomial Ideals. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CASC ![In: Computer Algebra in Scientific Computing, 8th International Workshop, CASC 2005, Kalamata, Greece, September 12-16, 2005, Proceedings, pp. 196-207, 2005, Springer, 3-540-28966-6. The full citation details ...](Pics/full.jpeg) |
2005 |
DBLP DOI BibTeX RDF |
|
46 | Rinovia Simanjuntak, Mirka Miller |
Maximum Order of Planar Digraphs. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IJCCGGT ![In: Combinatorial Geometry and Graph Theory, Indonesia-Japan Joint Conference,IJCCGGT 2003, Bandung, Indonesia, September 13-16, 2003, Revised Selected Papers, pp. 159-168, 2003, Springer, 3-540-24401-8. The full citation details ...](Pics/full.jpeg) |
2003 |
DBLP DOI BibTeX RDF |
|
46 | 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 |
46 | Johanne Cohen, Pierre Fraigniaud, Cyril Gavoille |
Recognizing Bipartite Incident-Graphs of Circulant Digraphs. ![Search on Bibsonomy](Pics/bibsonomy.png) |
WG ![In: Graph-Theoretic Concepts in Computer Science, 25th International Workshop, WG '99, Ascona, Switzerland, June 17-19, 1999, Proceedings, pp. 215-227, 1999, Springer, 3-540-66731-8. The full citation details ...](Pics/full.jpeg) |
1999 |
DBLP DOI BibTeX RDF |
broadcasting, gossiping, graph isomorphism, circulant graphs, chordal rings |
46 | 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 |
|
46 | 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 |
46 | Paul Hunter, Stephan Kreutzer |
Digraph measures: Kelly decompositions, games, and orderings. ![Search on Bibsonomy](Pics/bibsonomy.png) |
SODA ![In: Proceedings of the Eighteenth Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2007, New Orleans, Louisiana, USA, January 7-9, 2007, pp. 637-644, 2007, SIAM, 978-0-898716-24-5. The full citation details ...](Pics/full.jpeg) |
2007 |
DBLP BibTeX RDF |
|
46 | Guillaume Fertin, André Raspaud |
Families of Graphs Having Broadcasting and Gossiping Properties. ![Search on Bibsonomy](Pics/bibsonomy.png) |
WG ![In: Graph-Theoretic Concepts in Computer Science, 24th International Workshop, WG '98, Smolenice Castle, Slovak Republic, June 18-20, 1998, Proceedings, pp. 63-77, 1998, Springer, 3-540-65195-0. The full citation details ...](Pics/full.jpeg) |
1998 |
DBLP DOI BibTeX RDF |
minimum broadcast graphs, minimum gossip graphs, Knödel graphs, Broadcasting, hypercubes, gossiping, circulant graphs |
46 | 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 |
|
46 | Henk Meijer, R. Dawes |
Fault Tolerant Networks of Specified Diameter. ![Search on Bibsonomy](Pics/bibsonomy.png) |
WG ![In: Graph-Theoretic Concepts in Computer Science, 14th International Workshop, WG '88, Amsterdam, The Netherlands, June 15-17, 1988, Proceedings, pp. 74-86, 1988, Springer, 3-540-50728-0. The full citation details ...](Pics/full.jpeg) |
1988 |
DBLP DOI BibTeX RDF |
|
35 | Francesco Giordano, Giuseppe Liotta, Sue Whitesides |
Embeddability Problems for Upward Planar 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. 242-253, 2008, Springer, 978-3-642-00218-2. The full citation details ...](Pics/full.jpeg) |
2008 |
DBLP DOI BibTeX RDF |
|
35 | Jiangyan Guo, Elkin Vumar |
The Vertex-Neighbor-Integrity of Digraphs. ![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. 370-376, 2007, Springer, 978-3-540-72587-9. The full citation details ...](Pics/full.jpeg) |
2007 |
DBLP DOI BibTeX RDF |
Vertex-neighbor-integrity, directed vertex-neighbor-integrity, orientation |
35 | Pascale Kuntz, Bruno Pinaud, Rémi Lehn |
Minimizing crossings in hierarchical digraphs with a hybridized genetic algorithm. ![Search on Bibsonomy](Pics/bibsonomy.png) |
J. Heuristics ![In: J. Heuristics 12(1-2), pp. 23-36, 2006. The full citation details ...](Pics/full.jpeg) |
2006 |
DBLP DOI BibTeX RDF |
Hierarchical digraph, Genetic algorithm, Metaheuristics, Graph drawing |
35 | Efstratios Kontopoulos, Nick Bassiliades |
Graphical Representation of Defeasible Logic Rules Using Digraphs. ![Search on Bibsonomy](Pics/bibsonomy.png) |
SETN ![In: Advances in Artificial Intelligence, 4th Helenic Conference on AI, SETN 2006, Heraklion, Crete, Greece, May 18-20, 2006, Proceedings, pp. 529-533, 2006, Springer, 3-540-34117-X. The full citation details ...](Pics/full.jpeg) |
2006 |
DBLP DOI BibTeX RDF |
|
35 | Yus Mochamad Cholily, Edy Tri Baskoro, Saladin Uttunggadewa |
Some Conditions for the Existence of ( d, k)-Digraphs. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IJCCGGT ![In: Combinatorial Geometry and Graph Theory, Indonesia-Japan Joint Conference,IJCCGGT 2003, Bandung, Indonesia, September 13-16, 2003, Revised Selected Papers, pp. 87-93, 2003, Springer, 3-540-24401-8. The full citation details ...](Pics/full.jpeg) |
2003 |
DBLP DOI BibTeX RDF |
|
35 | Wenjun Xiao, Behrooz Parhami |
Some Conclusions on Cayley Digraphs and Their Applications to Interconnection Networks. ![Search on Bibsonomy](Pics/bibsonomy.png) |
GCC (2) ![In: Grid and Cooperative Computing, Second International Workshop, GCC 2003, Shanghai, China, December 7-10, 2003, Revised Papers, Part II, pp. 408-412, 2003, Springer, 3-540-21993-5. The full citation details ...](Pics/full.jpeg) |
2003 |
DBLP DOI BibTeX RDF |
|
35 | Emilio Di Giacomo, Walter Didimo, Giuseppe Liotta, Stephen K. Wismath |
Book Embeddings and Point-Set Embeddings of Series-Parallel Digraphs. ![Search on Bibsonomy](Pics/bibsonomy.png) |
GD ![In: Graph Drawing, 10th International Symposium, GD 2002, Irvine, CA, USA, August 26-28, 2002, Revised Papers, pp. 162-173, 2002, Springer, 3-540-00158-1. The full citation details ...](Pics/full.jpeg) |
2002 |
DBLP DOI BibTeX RDF |
|
35 | Jean-Claude Bermond, Xavier Muñoz, Alberto Marchetti-Spaccamela |
Induced Broadcasting Algorithms in Iterated Line Digraphs. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Euro-Par, Vol. I ![In: Euro-Par '96 Parallel Processing, Second International Euro-Par Conference, Lyon, France, August 26-29, 1996, Proceedings, Volume I, pp. 313-324, 1996, Springer, 3-540-61626-8. The full citation details ...](Pics/full.jpeg) |
1996 |
DBLP DOI BibTeX RDF |
|
35 | Manfred Schnitzler |
Graph Grammars and the Complexity Gap in the Isomorphism Problem for Acyclic Digraphs. ![Search on Bibsonomy](Pics/bibsonomy.png) |
WG ![In: Graphtheoretic Concepts in Computer Science, Proceedings of the International Workshop WG '80, Bad Honnef, Germany, June 15-18, 1980, pp. 137-149, 1980, Springer, 3-540-10291-4. The full citation details ...](Pics/full.jpeg) |
1980 |
DBLP DOI BibTeX RDF |
|
35 | Kenjiro Takazawa |
A weighted even factor algorithm. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Math. Program. ![In: Math. Program. 115(2), pp. 223-237, 2008. The full citation details ...](Pics/full.jpeg) |
2008 |
DBLP DOI BibTeX RDF |
Mathematics Subject Classification (2000) 90C27, 05C70 |
35 | Noga Alon, Fedor V. Fomin, Gregory Z. Gutin, Michael Krivelevich, Saket Saurabh 0001 |
Parameterized Algorithms for Directed Maximum Leaf Problems. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ICALP ![In: Automata, Languages and Programming, 34th International Colloquium, ICALP 2007, Wroclaw, Poland, July 9-13, 2007, Proceedings, pp. 352-362, 2007, Springer, 978-3-540-73419-2. The full citation details ...](Pics/full.jpeg) |
2007 |
DBLP DOI BibTeX RDF |
|
35 | Anna Agusti-Torra, Cristina Cervello-Pastor, Miguel Angel Fiol |
A New Approach to Loss-Free Packet/Burst Transmission in All-Optical Networks. ![Search on Bibsonomy](Pics/bibsonomy.png) |
BROADNETS ![In: 3rd International Conference on Broadband Communications, Networks, and Systems (BROADNETS 2006), 1-5 October 2006, San José, California, USA, 2006, IEEE, 978-1-4244-0425-4. The full citation details ...](Pics/full.jpeg) |
2006 |
DBLP DOI BibTeX RDF |
|
35 | Mohammad Ali Safari |
D-Width: A More Natural Measure for Directed Tree Width. ![Search on Bibsonomy](Pics/bibsonomy.png) |
MFCS ![In: Mathematical Foundations of Computer Science 2005, 30th International Symposium, MFCS 2005, Gdansk, Poland, August 29 - September 2, 2005, Proceedings, pp. 745-756, 2005, Springer, 3-540-28702-7. The full citation details ...](Pics/full.jpeg) |
2005 |
DBLP DOI BibTeX RDF |
|
35 | Paola Bertolazzi, Giuseppe Di Battista, Walter Didimo |
Quasi-Upward Planarity. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Algorithmica ![In: Algorithmica 32(3), pp. 474-506, 2002. The full citation details ...](Pics/full.jpeg) |
2002 |
DBLP DOI BibTeX RDF |
Upward, Flow techniques, Branch and bound, Planarity |
35 | Bruce L. Bauslaugh |
List-Compactness of Infinite Directed Graphs. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Graphs Comb. ![In: Graphs Comb. 17(1), pp. 17-38, 2001. The full citation details ...](Pics/full.jpeg) |
2001 |
DBLP DOI BibTeX RDF |
|
35 | 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 |
35 | 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 |
|
35 | 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 |
34 | Deke Guo, Jie Wu 0001, Yunhao Liu 0001, Hai Jin 0001, Hanhua Chen, Tao Chen 0013 |
Quasi-Kautz Digraphs for Peer-to-Peer Networks. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IEEE Trans. Parallel Distributed Syst. ![In: IEEE Trans. Parallel Distributed Syst. 22(6), pp. 1042-1055, 2011. The full citation details ...](Pics/full.jpeg) |
2011 |
DBLP DOI BibTeX RDF |
Constant degree networks, Kautz digraphs, peer-to-peer networks |
34 | Noel Henry Patson |
Visualizing Global Patterns in Huge Digraphs. ![Search on Bibsonomy](Pics/bibsonomy.png) |
NSS ![In: Third International Conference on Network and System Security, NSS 2009, Gold Coast, Queensland, Australia, October 19-21, 2009, pp. 480-483, 2009, IEEE Computer Society, 978-0-7695-3838-9. The full citation details ...](Pics/full.jpeg) |
2009 |
DBLP DOI BibTeX RDF |
visualization, digraphs |
34 | Azman Samsudin, Kyungsook Y. Lee |
nD-dBPN: New Self-Routing Permutation Networks Based On the de Bruijn Digraphs. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ICPP ![In: 1998 International Conference on Parallel Processing (ICPP '98), 10-14 August 1998, Minneapolis, Minnesota, USA, Proceedings, pp. 604-611, 1998, IEEE Computer Society, 0-8186-8650-2. The full citation details ...](Pics/full.jpeg) |
1998 |
DBLP DOI BibTeX RDF |
Non-blocking Networks, de Bruijn Digraphs and Banyan Networks, Permutation Networks |
34 | 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 |
23 | Dean Crnkovic, Andrea Svob |
Self-Orthogonal Codes from Deza Graphs, Normally Regular Digraphs and Deza Digraphs. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Graphs Comb. ![In: Graphs Comb. 40(2), pp. 35, April 2024. The full citation details ...](Pics/full.jpeg) |
2024 |
DBLP DOI BibTeX RDF |
|
23 | Junran Yu |
Directed Tree Connectivity of Symmetric Digraphs and Complete Bipartite Digraphs. ![Search on Bibsonomy](Pics/bibsonomy.png) |
J. Interconnect. Networks ![In: J. Interconnect. Networks 23(3), pp. 2250008:1-2250008:11, September 2023. The full citation details ...](Pics/full.jpeg) |
2023 |
DBLP DOI BibTeX RDF |
|
23 | Ahmad Abdi, Gérard Cornuéjols, Michael Zlatin |
On Packing Dijoins in Digraphs and Weighted Digraphs. ![Search on Bibsonomy](Pics/bibsonomy.png) |
SIAM J. Discret. Math. ![In: SIAM J. Discret. Math. 37(4), pp. 2417-2461, December 2023. The full citation details ...](Pics/full.jpeg) |
2023 |
DBLP DOI BibTeX RDF |
|
23 | Yaoyao Zhang, Jixiang Meng |
On the optimality of 3-restricted arc connectivity for digraphs and bipartite digraphs. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Discuss. Math. Graph Theory ![In: Discuss. Math. Graph Theory 42(2), pp. 321-332, 2022. The full citation details ...](Pics/full.jpeg) |
2022 |
DBLP DOI BibTeX RDF |
|
23 | Zhengyu Guo, Dongdong Jia, Gengsheng Zhang |
Minimum arc-cuts of normally regular digraphs and Deza digraphs. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Discret. Math. ![In: Discret. Math. 345(7), pp. 112879, 2022. The full citation details ...](Pics/full.jpeg) |
2022 |
DBLP DOI BibTeX RDF |
|
23 | Louis DeBiasio, András Gyárfás |
Covering 2-colored complete digraphs by monochromatic d $d$ -dominating digraphs. ![Search on Bibsonomy](Pics/bibsonomy.png) |
J. Graph Theory ![In: J. Graph Theory 100(4), pp. 721-726, 2022. The full citation details ...](Pics/full.jpeg) |
2022 |
DBLP DOI BibTeX RDF |
|
23 | Ruixia Wang, Linxin Wu, Wei Meng |
Extremal digraphs on Meyniel-type condition for hamiltonian cycles in balanced bipartite digraphs. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Discret. Math. Theor. Comput. Sci. ![In: Discret. Math. Theor. Comput. Sci. 23(3), 2021. The full citation details ...](Pics/full.jpeg) |
2021 |
DBLP DOI BibTeX RDF |
|
23 | Ruixia Wang |
Extremal digraphs on Woodall-type condition for Hamiltonian cycles in balanced bipartite digraphs. ![Search on Bibsonomy](Pics/bibsonomy.png) |
J. Graph Theory ![In: J. Graph Theory 97(2), pp. 194-207, 2021. The full citation details ...](Pics/full.jpeg) |
2021 |
DBLP DOI BibTeX RDF |
|
23 | Frank Gurski, Dominique Komander, Marvin Lindemann |
Homomorphisms to Digraphs with Large Girth and Oriented Colorings of Minimal Series-Parallel Digraphs. ![Search on Bibsonomy](Pics/bibsonomy.png) |
WALCOM ![In: WALCOM: Algorithms and Computation - 15th International Conference and Workshops, WALCOM 2021, Yangon, Myanmar, February 28 - March 2, 2021, Proceedings, pp. 182-194, 2021, Springer, 978-3-030-68210-1. The full citation details ...](Pics/full.jpeg) |
2021 |
DBLP DOI BibTeX RDF |
|
23 | Xiuwen Yang, Ligong Wang 0001 |
Extremal Laplacian energy of directed trees, unicyclic digraphs and bicyclic digraphs. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Appl. Math. Comput. ![In: Appl. Math. Comput. 366, 2020. The full citation details ...](Pics/full.jpeg) |
2020 |
DBLP DOI BibTeX RDF |
|
23 | Stephan Dominique Andres |
On kernels in strongly game-perfect digraphs and a characterisation of weakly game-perfect digraphs. ![Search on Bibsonomy](Pics/bibsonomy.png) |
AKCE Int. J. Graphs Comb. ![In: AKCE Int. J. Graphs Comb. 17(1), pp. 539-549, 2020. The full citation details ...](Pics/full.jpeg) |
2020 |
DBLP DOI BibTeX RDF |
|
23 | Cristina Dalfó |
From Subkautz Digraphs to Cyclic Kautz Digraphs. ![Search on Bibsonomy](Pics/bibsonomy.png) |
J. Interconnect. Networks ![In: J. Interconnect. Networks 18(2-3), pp. 1850006:1-1850006:16, 2018. The full citation details ...](Pics/full.jpeg) |
2018 |
DBLP DOI BibTeX RDF |
|
23 | Marcel Abas, Tomás Vetrík |
Large Cayley digraphs and bipartite Cayley digraphs of odd diameters. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Discret. Math. ![In: Discret. Math. 340(6), pp. 1162-1171, 2017. The full citation details ...](Pics/full.jpeg) |
2017 |
DBLP DOI BibTeX RDF |
|
23 | Hortensia Galeana-Sánchez, Mika Olsen |
CKI-Digraphs, Generalized Sums and Partitions of Digraphs. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Graphs Comb. ![In: Graphs Comb. 32(1), pp. 123-131, 2016. The full citation details ...](Pics/full.jpeg) |
2016 |
DBLP DOI BibTeX RDF |
|
23 | Tay-Woei Shyu |
Decomposition of Complete Bipartite Digraphs and Complete Digraphs into Directed Paths and Directed Cycles of Fixed Even Length. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Graphs Comb. ![In: Graphs Comb. 31(5), pp. 1715-1725, 2015. The full citation details ...](Pics/full.jpeg) |
2015 |
DBLP DOI BibTeX RDF |
|
23 | Thamodharan Govindan, Appu Muthusamy |
Nonexistence of a pair of arc disjoint directed Hamilton cycles on line digraphs of 2-diregular digraphs. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Discret. Math. Algorithms Appl. ![In: Discret. Math. Algorithms Appl. 7(3), pp. 1550034:1-1550034:6, 2015. The full citation details ...](Pics/full.jpeg) |
2015 |
DBLP DOI BibTeX RDF |
|
23 | Shiying Wang, Ruixia Wang |
Underlying graphs of 3-quasi-transitive digraphs and 3-transitive digraphs. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Discuss. Math. Graph Theory ![In: Discuss. Math. Graph Theory 33(2), pp. 429-435, 2013. The full citation details ...](Pics/full.jpeg) |
2013 |
DBLP DOI BibTeX RDF |
|
23 | César Hernández-Cruz |
4-transitive digraphs I: the structure of strong 4-transitive digraphs. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Discuss. Math. Graph Theory ![In: Discuss. Math. Graph Theory 33(2), pp. 247-260, 2013. The full citation details ...](Pics/full.jpeg) |
2013 |
DBLP DOI BibTeX RDF |
|
23 | Shiying Wang, Ruixia Wang |
Independent sets and non-augmentable paths in arc-locally in-semicomplete digraphs and quasi-arc-transitive digraphs. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Discret. Math. ![In: Discret. Math. 311(4), pp. 282-288, 2011. The full citation details ...](Pics/full.jpeg) |
2011 |
DBLP DOI BibTeX RDF |
|
23 | Mahyar R. Malekpour |
A Self-Stabilizing Synchronization Protocol for Arbitrary Digraphs: A Self-Stabilizing Distributed Clock Synchronization Protocol For Arbitrary Digraphs. ![Search on Bibsonomy](Pics/bibsonomy.png) |
PRDC ![In: 17th IEEE Pacific Rim International Symposium on Dependable Computing, PRDC 2011, Pasadena, CA, USA, December 12-14, 2011, pp. 254-263, 2011, IEEE Computer Society, 978-1-4577-2005-5. The full citation details ...](Pics/full.jpeg) |
2011 |
DBLP DOI BibTeX RDF |
|
23 | Mária Zdímalová, Lubica Staneková |
Which Faber-Moore-Chen digraphs are Cayley digraphs? ![Search on Bibsonomy](Pics/bibsonomy.png) |
Discret. Math. ![In: Discret. Math. 310(17-18), pp. 2238-2240, 2010. The full citation details ...](Pics/full.jpeg) |
2010 |
DBLP DOI BibTeX RDF |
|
23 | Arvind Gupta, Gregory Z. Gutin, Mehdi Karimi 0001, Eun Jung Kim 0002, Arash Rafiey |
Minimum cost homomorphisms to locally semicomplete digraphs and quasi-transitive digraphs. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Australas. J Comb. ![In: Australas. J Comb. 46, pp. 217-232, 2010. The full citation details ...](Pics/full.jpeg) |
2010 |
DBLP BibTeX RDF |
|
23 | Yubin Gao, Yanling Shao |
Double vertex digraphs of digraphs. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Discret. Math. ![In: Discret. Math. 309(8), pp. 2432-2444, 2009. The full citation details ...](Pics/full.jpeg) |
2009 |
DBLP DOI BibTeX RDF |
|
23 | Haiying Wang, Liang Sun |
New results on the eccentric digraphs of the digraphs. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Ars Comb. ![In: Ars Comb. 89, 2008. The full citation details ...](Pics/full.jpeg) |
2008 |
DBLP BibTeX RDF |
|
23 | B. P. Tan |
On semicomplete multipartite digraphs whose king sets are semicomplete digraphs. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Discret. Math. ![In: Discret. Math. 308(12), pp. 2564-2570, 2008. The full citation details ...](Pics/full.jpeg) |
2008 |
DBLP DOI BibTeX RDF |
|
23 | Yosuke Kikuchi, Yukio Shibata |
On the domination numbers of generalized de Bruijn digraphs and generalized Kautz digraphs. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Inf. Process. Lett. ![In: Inf. Process. Lett. 86(2), pp. 79-85, 2003. The full citation details ...](Pics/full.jpeg) |
2003 |
DBLP DOI BibTeX RDF |
|
23 | Nicolas Lichiardopol |
Echange total, diffusion et quelques résultats sur les itérés de line-digraphs. (Total exchange, broadcasting and some results on iterated line digraphs). ![Search on Bibsonomy](Pics/bibsonomy.png) |
|
2003 |
RDF |
|
23 | Jørgen Bang-Jensen, Anders Yeo |
The Minimum Spanning Strong Subdigraph Problem for Extended Semicomplete Digraphs and Semicomplete Bipartite Digraphs. ![Search on Bibsonomy](Pics/bibsonomy.png) |
J. Algorithms ![In: J. Algorithms 41(1), pp. 1-19, 2001. The full citation details ...](Pics/full.jpeg) |
2001 |
DBLP DOI BibTeX RDF |
|
23 | Josep M. Brunat, Montserrat Maureso |
Endo-circulant digraphs of degree two and Cayley digraphs on finite abelian groups. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Discret. Math. ![In: Discret. Math. 211, pp. 203-208, 2000. The full citation details ...](Pics/full.jpeg) |
2000 |
DBLP DOI BibTeX RDF |
|
23 | Jørgen Bang-Jensen |
Linkages in locally semicomplete digraphs and quasi-transitive digraphs. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Discret. Math. ![In: Discret. Math. 196(1-3), pp. 13-27, 1999. The full citation details ...](Pics/full.jpeg) |
1999 |
DBLP DOI BibTeX RDF |
|
23 | Dominique Barth, Marie-Claude Heydemann |
A New Digraphs Composition with Applications to De Bruijn and Generalized De Bruijn Digraphs. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Discret. Appl. Math. ![In: Discret. Appl. Math. 77(2), pp. 99-118, 1997. The full citation details ...](Pics/full.jpeg) |
1997 |
DBLP DOI BibTeX RDF |
|
23 | Dominique Barth, Marie-Claude Heydemann |
A New Digraphs Composition with Applications to De Bruijn and Generalized De Bruijn Digraphs. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Discret. Appl. Math. ![In: Discret. Appl. Math. 80(1), pp. 115, 1997. The full citation details ...](Pics/full.jpeg) |
1997 |
DBLP DOI BibTeX RDF |
|
23 | Hortensia Galeana-Sánchez, Victor Neumann-Lara |
KP-digraphs and CKI-digraphs satisfying the k-Meyniel's condition. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Discuss. Math. Graph Theory ![In: Discuss. Math. Graph Theory 16(1), pp. 5-16, 1996. The full citation details ...](Pics/full.jpeg) |
1996 |
DBLP DOI BibTeX RDF |
|
23 | Robert F. Cohen, Giuseppe Di Battista, Roberto Tamassia, Ioannis G. Tollis |
Dynamic Graph Drawings: Trees, Series-Parallel Digraphs, and Planar ST-Digraphs. ![Search on Bibsonomy](Pics/bibsonomy.png) |
SIAM J. Comput. ![In: SIAM J. Comput. 24(5), pp. 970-1001, 1995. The full citation details ...](Pics/full.jpeg) |
1995 |
DBLP DOI BibTeX RDF |
|
23 | Hortensia Galeana-Sánchez, Victor Neumann-Lara |
New Extensions of Kernel Perfect Digraphs to Kernel Imperfect Critical Digraphs. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Graphs Comb. ![In: Graphs Comb. 10(2-4), pp. 329-336, 1994. The full citation details ...](Pics/full.jpeg) |
1994 |
DBLP DOI BibTeX RDF |
|
23 | Peter J. Cameron, Cheryl E. Praeger, Nicholas C. Wormald |
Infinite highly arc transitive digraphs and universal covering digraphs. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Comb. ![In: Comb. 13(4), pp. 377-396, 1993. The full citation details ...](Pics/full.jpeg) |
1993 |
DBLP DOI BibTeX RDF |
|
23 | Miguel Angel Fiol |
On super-edge-connected digraphs and bipartite digraphs. ![Search on Bibsonomy](Pics/bibsonomy.png) |
J. Graph Theory ![In: J. Graph Theory 16(6), pp. 545-555, 1992. The full citation details ...](Pics/full.jpeg) |
1992 |
DBLP DOI BibTeX RDF |
|
23 | Hortensia Galeana-Sánchez, Victor Neumann-Lara |
Extending kernel perfect digraphs to kernel perfect critical digraphs. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Discret. Math. ![In: Discret. Math. 94(3), pp. 181-187, 1991. The full citation details ...](Pics/full.jpeg) |
1991 |
DBLP DOI BibTeX RDF |
|
23 | Lowell W. Beineke, Christina Zamfirescu |
Connection digraphs and second-order line digraphs. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Discret. Math. ![In: Discret. Math. 39(3), pp. 237-254, 1982. The full citation details ...](Pics/full.jpeg) |
1982 |
DBLP DOI BibTeX RDF |
|
23 | Kenneth A. Berman |
Aneulerian digraphs and the determination of those Eulerian digraphs having an odd number of directed Eulerian paths. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Discret. Math. ![In: Discret. Math. 22(1), pp. 75-80, 1978. The full citation details ...](Pics/full.jpeg) |
1978 |
DBLP DOI BibTeX RDF |
|
23 | Lowell W. Beineke, Robert L. Hemminger |
Infinite digraphs isomorphic with their line digraphs. ![Search on Bibsonomy](Pics/bibsonomy.png) |
J. Comb. Theory, Ser. B ![In: J. Comb. Theory, Ser. B 21(3), pp. 245-256, 1976. The full citation details ...](Pics/full.jpeg) |
1976 |
DBLP DOI BibTeX RDF |
|
23 | 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 |
23 | 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 |
|
23 | 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 |
|
23 | 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 |
|