Hits ?▲ |
Authors |
Title |
Venue |
Year |
Link |
Author keywords |
78 | Lukasz Kowalik |
Approximation Scheme for Lowest Outdegree Orientation and Graph Density Measures. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ISAAC ![In: Algorithms and Computation, 17th International Symposium, ISAAC 2006, Kolkata, India, December 18-20, 2006, Proceedings, pp. 557-566, 2006, Springer, 3-540-49694-7. The full citation details ...](Pics/full.jpeg) |
2006 |
DBLP DOI BibTeX RDF |
|
69 | Chitrasena Bhat, Niranjan N. Chiplunkar |
Heuristic Technology Mapper For Lut Based Fpgas. ![Search on Bibsonomy](Pics/bibsonomy.png) |
VLSI Design ![In: 12th International Conference on VLSI Design (VLSI Design 1999), 10-13 January 1999, Goa, India, pp. 390-393, 1999, IEEE Computer Society, 0-7695-0013-7. The full citation details ...](Pics/full.jpeg) |
1999 |
DBLP DOI BibTeX RDF |
|
44 | Yuichi Asahiro, Jesper Jansson 0001, Eiji Miyano, Hirotaka Ono 0001 |
Graph orientation to maximize the minimum weighted outdegree. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IPDPS ![In: 23rd IEEE International Symposium on Parallel and Distributed Processing, IPDPS 2009, Rome, Italy, May 23-29, 2009, pp. 1-8, 2009, IEEE. The full citation details ...](Pics/full.jpeg) |
2009 |
DBLP DOI BibTeX RDF |
|
44 | Yuichi Asahiro, Jesper Jansson 0001, Eiji Miyano, Hirotaka Ono 0001, Kouhei Zenmyo |
Approximation Algorithms for the Graph Orientation Minimizing the Maximum Weighted Outdegree. ![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. 167-177, 2007, Springer, 978-3-540-72868-9. The full citation details ...](Pics/full.jpeg) |
2007 |
DBLP DOI BibTeX RDF |
|
34 | Eric Allender, David A. Mix Barrington, Tanmoy Chakraborty 0001, Samir Datta, Sambuddha Roy |
Planar and Grid Graph Reachability Problems. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Theory Comput. Syst. ![In: Theory Comput. Syst. 45(4), pp. 675-723, 2009. The full citation details ...](Pics/full.jpeg) |
2009 |
DBLP DOI BibTeX RDF |
Logspace, Algorithms, Planar graphs, Reachability, Complexity theory, Circuit complexity, Grid graphs |
34 | Hal A. Kierstead, Daqing Yang |
Very Asymmetric Marking Games. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Order ![In: Order 22(2), pp. 93-107, 2005. The full citation details ...](Pics/full.jpeg) |
2005 |
DBLP DOI BibTeX RDF |
coloring number, competitive coloring, planar graph |
34 | Radhika Ramamurthi, Douglas B. West |
Hypergraph Extension Of The Alon-Tarsi List Coloring Theorem. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Comb. ![In: Comb. 25(3), pp. 355-366, 2005. The full citation details ...](Pics/full.jpeg) |
2005 |
DBLP DOI BibTeX RDF |
Mathematics Subject Classification (2000): 05C15, 05C65 |
34 | Sarunas Girdzijauskas, Anwitaman Datta, Karl Aberer |
On Small World Graphs in Non-uniformly Distributed Key Spaces. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ICDE Workshops ![In: Proceedings of the 21st International Conference on Data Engineering Workshops, ICDE 2005, 5-8 April 2005, Tokyo, Japan, pp. 1187, 2005, IEEE Computer Society, 0-7695-2657-8. The full citation details ...](Pics/full.jpeg) |
2005 |
DBLP DOI BibTeX RDF |
Storage Load Balancing, Routing, Distributed Hash Tables, Small-World graphs |
33 | Mikael Gustafsson, Michael Hornquist, Anna Lombardi |
Constructing and Analyzing a Large-Scale Gene-to-Gene Regulatory Network-Lasso-Constrained Inference and Biological Validation. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IEEE ACM Trans. Comput. Biol. Bioinform. ![In: IEEE ACM Trans. Comput. Biol. Bioinform. 2(3), pp. 254-261, 2005. The full citation details ...](Pics/full.jpeg) |
2005 |
DBLP DOI BibTeX RDF |
outdegree, validation, time series analysis, Biology and genetics, gene network, Lasso, network problems, network inference, yeast |
33 | Arne Andersson, Thomas Ottmann |
Faster Uniquely Represented Dictionaries ![Search on Bibsonomy](Pics/bibsonomy.png) |
FOCS ![In: 32nd Annual Symposium on Foundations of Computer Science, San Juan, Puerto Rico, 1-4 October 1991, pp. 642-649, 1991, IEEE Computer Society, 0-8186-2445-0. The full citation details ...](Pics/full.jpeg) |
1991 |
DBLP DOI BibTeX RDF |
bounded outdegree graph, ordered universe, search, lower bound, update, insert, delete, binary search tree, worst case, dictionary problem |
26 | Hilal A. Ganie, Shariefuddin Pirzada |
On the first outdegree Zagreb index of a digraph. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Discret. Math. ![In: Discret. Math. 347(1), pp. 113726, January 2024. The full citation details ...](Pics/full.jpeg) |
2024 |
DBLP DOI BibTeX RDF |
|
26 | Ngo Dac Tan |
A decomposition for digraphs with minimum outdegree 3 having no vertex disjoint cycles of different lengths. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Discuss. Math. Graph Theory ![In: Discuss. Math. Graph Theory 43(2), pp. 573-581, 2023. The full citation details ...](Pics/full.jpeg) |
2023 |
DBLP DOI BibTeX RDF |
|
26 | Svante Janson |
On Knuth's conjecture for back and forward arcs in Depth First Search in a random digraph with geometric outdegree distribution. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CoRR ![In: CoRR abs/2301.04131, 2023. The full citation details ...](Pics/full.jpeg) |
2023 |
DBLP DOI BibTeX RDF |
|
26 | Qixuan Yuan, Ruifang Liu, Jinjiang Yuan |
The Aα-spectral radius of nonregular graphs (digraphs) and maximum degree (outdegree). ![Search on Bibsonomy](Pics/bibsonomy.png) |
Discret. Optim. ![In: Discret. Optim. 47, pp. 100758, February 2023. The full citation details ...](Pics/full.jpeg) |
2023 |
DBLP DOI BibTeX RDF |
|
26 | Marco Bressan 0002, Matthias Lanzinger, Marc Roth |
The Complexity of Pattern Counting in Directed Graphs, Parameterised by the Outdegree. ![Search on Bibsonomy](Pics/bibsonomy.png) |
STOC ![In: Proceedings of the 55th Annual ACM Symposium on Theory of Computing, STOC 2023, Orlando, FL, USA, June 20-23, 2023, pp. 542-552, 2023, ACM, 978-1-4503-9913-5. The full citation details ...](Pics/full.jpeg) |
2023 |
DBLP DOI BibTeX RDF |
|
26 | Chentao Xu, Zhe You, Liwen Zhang, Minghong Zhou |
The maximum outdegree power of complete k-partite oriented graphs. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Appl. Math. Comput. ![In: Appl. Math. Comput. 433, pp. 127414, 2022. The full citation details ...](Pics/full.jpeg) |
2022 |
DBLP DOI BibTeX RDF |
|
26 | Lior Gishboliner, Raphael Steiner, Tibor Szabó |
Oriented Cycles in Digraphs of Large Outdegree. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Comb. ![In: Comb. 42(6), pp. 1145-1187, December 2022. The full citation details ...](Pics/full.jpeg) |
2022 |
DBLP DOI BibTeX RDF |
|
26 | Yandong Liu, Dong Han, Lujia Wang 0001, Cheng-Zhong Xu 0001 |
Novel Topological Relationship solutions to the ALV Multi-indegree-Multi-outdegree Task sequence Planning Problem. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Int. J. Robotics Autom. ![In: Int. J. Robotics Autom. 37(3), 2022. The full citation details ...](Pics/full.jpeg) |
2022 |
DBLP DOI BibTeX RDF |
|
26 | Philippe Jacquet, Svante Janson |
Depth-First Search performance in a random digraph with geometric outdegree distribution. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CoRR ![In: CoRR abs/2212.14865, 2022. The full citation details ...](Pics/full.jpeg) |
2022 |
DBLP DOI BibTeX RDF |
|
26 | Daniela Bubboloni, Michele Gori |
The net-outdegree social choice correspondence. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CoRR ![In: CoRR abs/2211.06626, 2022. The full citation details ...](Pics/full.jpeg) |
2022 |
DBLP DOI BibTeX RDF |
|
26 | Marco Bressan 0002, Matthias Lanzinger, Marc Roth |
The Complexity of Pattern Counting in Directed Graphs, Parameterised by the Outdegree. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CoRR ![In: CoRR abs/2211.01905, 2022. The full citation details ...](Pics/full.jpeg) |
2022 |
DBLP DOI BibTeX RDF |
|
26 | Guanwu Liu, Xingxing Yu |
Partitioning digraphs with outdegree at least 4. ![Search on Bibsonomy](Pics/bibsonomy.png) |
J. Graph Theory ![In: J. Graph Theory 98(4), pp. 604-622, 2021. The full citation details ...](Pics/full.jpeg) |
2021 |
DBLP DOI BibTeX RDF |
|
26 | Weige Xi, Ligong Wang 0001 |
The Aα spectral radius and maximum outdegree of irregular digraphs. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Discret. Optim. ![In: Discret. Optim. 38, pp. 100592, 2020. The full citation details ...](Pics/full.jpeg) |
2020 |
DBLP DOI BibTeX RDF |
|
26 | Hsin-Hao Su, Hoa T. Vu |
Distributed Dense Subgraph Detection and Low Outdegree Orientation. ![Search on Bibsonomy](Pics/bibsonomy.png) |
DISC ![In: 34th International Symposium on Distributed Computing, DISC 2020, October 12-16, 2020, Virtual Conference., pp. 15:1-15:18, 2020, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-168-9. The full citation details ...](Pics/full.jpeg) |
2020 |
DBLP DOI BibTeX RDF |
|
26 | Rosena R. X. Du, Jia He, Xueli Yun |
Counting Vertices with Given Outdegree in Plane Trees and k-ary Trees. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Graphs Comb. ![In: Graphs Comb. 35(1), pp. 221-229, 2019. The full citation details ...](Pics/full.jpeg) |
2019 |
DBLP DOI BibTeX RDF |
|
26 | Hsin-Hao Su, Hoa T. Vu |
Distributed Dense Subgraph Detection and Low Outdegree Orientation. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CoRR ![In: CoRR abs/1907.12443, 2019. The full citation details ...](Pics/full.jpeg) |
2019 |
DBLP BibTeX RDF |
|
26 | Yan-An Hwang, Ding-Cheng You |
Erratum to "Ranking by outdegree for directed graphs" [Discrete Math. 271 (2003) 261-270]. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Discret. Math. ![In: Discret. Math. 342(7), pp. 2158-2160, 2019. The full citation details ...](Pics/full.jpeg) |
2019 |
DBLP DOI BibTeX RDF |
|
26 | William Lochet |
Immersion of transitive tournaments in digraphs with large minimum outdegree. ![Search on Bibsonomy](Pics/bibsonomy.png) |
J. Comb. Theory, Ser. B ![In: J. Comb. Theory, Ser. B 134, pp. 350-353, 2019. The full citation details ...](Pics/full.jpeg) |
2019 |
DBLP DOI BibTeX RDF |
|
26 | James M. Carraher, Stephen G. Hartke |
Eulerian Circuits with No Monochromatic Transitions in Edge-Colored Digraphs with all Vertices of Outdegree Three. ![Search on Bibsonomy](Pics/bibsonomy.png) |
SIAM J. Discret. Math. ![In: SIAM J. Discret. Math. 31(1), pp. 190-209, 2017. The full citation details ...](Pics/full.jpeg) |
2017 |
DBLP DOI BibTeX RDF |
|
26 | Ahmed Jedda, Hussein T. Mouftah |
Forming MS-Free and Outdegree-Limited Bluetooth Scatternets in Pessimistic Environments. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IEEE Internet Things J. ![In: IEEE Internet Things J. 2(6), pp. 538-550, 2015. The full citation details ...](Pics/full.jpeg) |
2015 |
DBLP DOI BibTeX RDF |
|
26 | Ahmed Jedda, Hussein T. Mouftah |
Forming MS-free and outdegree-limited Bluetooth scatternets in pessimistic environments. ![Search on Bibsonomy](Pics/bibsonomy.png) |
LCN ![In: IEEE 39th Conference on Local Computer Networks, LCN 2014, Edmonton, AB, Canada, 8-11 September, 2014, pp. 398-401, 2014, IEEE Computer Society, 978-1-4799-3778-3. The full citation details ...](Pics/full.jpeg) |
2014 |
DBLP DOI BibTeX RDF |
|
26 | Nicolas Lichiardopol |
Proof of the Caccetta-Häggkvist conjecture for in-tournaments with respect to the minimum outdegree, and pancyclicity. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Australas. J Comb. ![In: Australas. J Comb. 57, pp. 313-, 2013. The full citation details ...](Pics/full.jpeg) |
2013 |
DBLP BibTeX RDF |
|
26 | Ahmed Jedda, Guy-Vincent Jourdan, Hussein T. Mouftah |
Time-efficient algorithms for the outdegree limited bluetooth scatternet formation problem. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ISCC ![In: 2012 IEEE Symposium on Computers and Communications, ISCC 2012, Cappadocia, Turkey, July 1-4, 2012, pp. 132-138, 2012, IEEE Computer Society, 978-1-4673-2712-1. The full citation details ...](Pics/full.jpeg) |
2012 |
DBLP DOI BibTeX RDF |
|
26 | Paola Favati, Grazia Lotti, Ornella Menchi, Francesco Romani |
A Coupled Model for the Indegree and Outdegree Analysis of the Web. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Internet Math. ![In: Internet Math. 6(4), pp. 437-459, 2011. The full citation details ...](Pics/full.jpeg) |
2011 |
DBLP DOI BibTeX RDF |
|
26 | Yuichi Asahiro, Eiji Miyano, Hirotaka Ono 0001 |
Graph classes and the complexity of the graph orientation minimizing the maximum weighted outdegree. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Discret. Appl. Math. ![In: Discret. Appl. Math. 159(7), pp. 498-508, 2011. The full citation details ...](Pics/full.jpeg) |
2011 |
DBLP DOI BibTeX RDF |
|
26 | Yuichi Asahiro, Jesper Jansson 0001, Eiji Miyano, Hirotaka Ono 0001 |
Graph Orientation to Maximize the Minimum Weighted Outdegree. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Int. J. Found. Comput. Sci. ![In: Int. J. Found. Comput. Sci. 22(3), pp. 583-601, 2011. The full citation details ...](Pics/full.jpeg) |
2011 |
DBLP DOI BibTeX RDF |
|
26 | Yuichi Asahiro, Jesper Jansson 0001, Eiji Miyano, Hirotaka Ono 0001, Kouhei Zenmyo |
Approximation algorithms for the graph orientation minimizing the maximum weighted outdegree. ![Search on Bibsonomy](Pics/bibsonomy.png) |
J. Comb. Optim. ![In: J. Comb. Optim. 22(1), pp. 78-96, 2011. The full citation details ...](Pics/full.jpeg) |
2011 |
DBLP DOI BibTeX RDF |
|
26 | Mindaugas Bloznelis |
A random intersection digraph: Indegree and outdegree distributions. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Discret. Math. ![In: Discret. Math. 310(19), pp. 2560-2566, 2010. The full citation details ...](Pics/full.jpeg) |
2010 |
DBLP DOI BibTeX RDF |
|
26 | Stefko Miklavic, Primoz Sparl |
On Hamiltonicity of circulant digraphs of outdegree three. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Discret. Math. ![In: Discret. Math. 309(17), pp. 5437-5443, 2009. The full citation details ...](Pics/full.jpeg) |
2009 |
DBLP DOI BibTeX RDF |
|
26 | Daniela Kühn, Deryk Osthus, Andrew Young |
A note on complete subdivisions in digraphs of large outdegree. ![Search on Bibsonomy](Pics/bibsonomy.png) |
J. Graph Theory ![In: J. Graph Theory 57(1), pp. 1-6, 2008. The full citation details ...](Pics/full.jpeg) |
2008 |
DBLP DOI BibTeX RDF |
|
26 | Jeonghun Noh, Aditya Mavlankar, Pierpaolo Baccichet, Bernd Girod |
Reducing end-to-end transmission delay in P2P streaming systems using multiple trees with moderate outdegree. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ICME ![In: Proceedings of the 2008 IEEE International Conference on Multimedia and Expo, ICME 2008, June 23-26 2008, Hannover, Germany, pp. 473-476, 2008, IEEE Computer Society, 978-1-4244-2571-6. The full citation details ...](Pics/full.jpeg) |
2008 |
DBLP DOI BibTeX RDF |
|
26 | Yuichi Asahiro, Eiji Miyano, Hirotaka Ono 0001 |
Graph Classes and the Complexity of the Graph Orientation Minimizing the Maximum Weighted Outdegree. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CATS ![In: Theory of Computing 2008. Proc. Fourteenth Computing: The Australasian Theory Symposium (CATS 2008), Wollongong, NSW, Australia, January 22-25, 2008. Proceedings, pp. 97-106, 2008, Australian Computer Society, 978-1-920682-58-3. The full citation details ...](Pics/full.jpeg) |
2008 |
DBLP BibTeX RDF |
|
26 | Yuichi Asahiro, Eiji Miyano, Hirotaka Ono 0001, Kouhei Zenmyo |
Graph Orientation Algorithms to minimize the Maximum Outdegree. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Int. J. Found. Comput. Sci. ![In: Int. J. Found. Comput. Sci. 18(2), pp. 197-215, 2007. The full citation details ...](Pics/full.jpeg) |
2007 |
DBLP DOI BibTeX RDF |
|
26 | Yan Gao 0003, Yao Zhao 0003, Robert T. Schweller, Shobha Venkataraman, Yan Chen 0004, Dawn Xiaodong Song, Ming-Yang Kao |
Detecting Stealthy Spreaders Using Online Outdegree Histograms. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IWQoS ![In: Fifteenth IEEE International Workshop on Quality of Service, IWQoS 2007, Evanston, Illinois, USA, June 21-22, 2007, pp. 145-153, 2007, IEEE, 1-4244-1185-8. The full citation details ...](Pics/full.jpeg) |
2007 |
DBLP DOI BibTeX RDF |
|
26 | Sonoko Moriyama, Yoshio Okamoto |
The Even Outdegree Conjecture for Acyclic PLCP-Cubes in Dimension Five. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IEICE Trans. Inf. Syst. ![In: IEICE Trans. Inf. Syst. 89-D(8), pp. 2402-2404, 2006. The full citation details ...](Pics/full.jpeg) |
2006 |
DBLP DOI BibTeX RDF |
|
26 | Stéphane Bessy, Frédéric Havet, Etienne Birmelé |
Arc-chromatic number of digraphs in which every vertex has bounded outdegree or bounded indegree. ![Search on Bibsonomy](Pics/bibsonomy.png) |
J. Graph Theory ![In: J. Graph Theory 53(4), pp. 315-332, 2006. The full citation details ...](Pics/full.jpeg) |
2006 |
DBLP DOI BibTeX RDF |
|
26 | Yuichi Asahiro, Eiji Miyano, Hirotaka Ono 0001, Kouhei Zenmyo |
Graph Orientation Algorithms to Minimize the Maximum Outdegree. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CATS ![In: Theory of Computing 2006, Proceedings of the Twelfth Computing: The Australasian Theory Symposium (CATS2006). Hobart, Tasmania, Australia, 16-19 January 2006, Proceedings, pp. 11-20, 2006, Australian Computer Society, 1-920682-33-3. The full citation details ...](Pics/full.jpeg) |
2006 |
DBLP BibTeX RDF |
|
26 | Jian Shen |
Short Cycles in Digraphs with Local Average Outdegree at Least Two. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Electron. J. Comb. ![In: Electron. J. Comb. 10, 2003. The full citation details ...](Pics/full.jpeg) |
2003 |
DBLP DOI BibTeX RDF |
|
26 | René van den Brink, Robert P. Gilles |
Ranking by outdegree for directed graphs. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Discret. Math. ![In: Discret. Math. 271(1-3), pp. 261-270, 2003. The full citation details ...](Pics/full.jpeg) |
2003 |
DBLP DOI BibTeX RDF |
|
26 | Wolfgang Mader 0001 |
On Vertices of outdegree n in minimally n-connected digraphs. ![Search on Bibsonomy](Pics/bibsonomy.png) |
J. Graph Theory ![In: J. Graph Theory 39(2), pp. 129-144, 2002. The full citation details ...](Pics/full.jpeg) |
2002 |
DBLP DOI BibTeX RDF |
|
26 | Stephen C. Locke, Dave Witte |
On non-Hamiltonian circulant digraphs of outdegree three. ![Search on Bibsonomy](Pics/bibsonomy.png) |
J. Graph Theory ![In: J. Graph Theory 30(4), pp. 319-331, 1999. The full citation details ...](Pics/full.jpeg) |
1999 |
DBLP DOI BibTeX RDF |
|
26 | Matthias Fischer 0001, Tamás Lukovszki, Martin Ziegler 0001 |
Partitioned neighborhood spanners of minimal outdegree. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CCCG ![In: Proceedings of the 11th Canadian Conference on Computational Geometry, UBC, Vancouver, British Columbia, Canada, August 15-18, 1999, 1999. The full citation details ...](Pics/full.jpeg) |
1999 |
DBLP BibTeX RDF |
|
26 | Wolfgang Mader 0001 |
On topological tournaments of order 4 in digraphs of outdegree 3. ![Search on Bibsonomy](Pics/bibsonomy.png) |
J. Graph Theory ![In: J. Graph Theory 21(4), pp. 371-376, 1996. The full citation details ...](Pics/full.jpeg) |
1996 |
DBLP DOI BibTeX RDF |
|
26 | Wolfgang Mader 0001 |
Existence of Vertices of Local Connectivity k in Digraphs of Large Outdegree. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Comb. ![In: Comb. 15(4), pp. 533-539, 1995. The full citation details ...](Pics/full.jpeg) |
1995 |
DBLP DOI BibTeX RDF |
|
26 | Egon Balas, Matteo Fischetti |
The Fixed-Outdegree 1-Arborescence Polytope. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Math. Oper. Res. ![In: Math. Oper. Res. 17(4), pp. 1001-1018, 1992. The full citation details ...](Pics/full.jpeg) |
1992 |
DBLP DOI BibTeX RDF |
|
17 | Yingwu Zhu |
Measurement and analysis of an online content voting network: a case study of Digg. ![Search on Bibsonomy](Pics/bibsonomy.png) |
WWW ![In: Proceedings of the 19th International Conference on World Wide Web, WWW 2010, Raleigh, North Carolina, USA, April 26-30, 2010, pp. 1039-1048, 2010, ACM, 978-1-60558-799-8. The full citation details ...](Pics/full.jpeg) |
2010 |
DBLP DOI BibTeX RDF |
content promotion, social networks, content filtering |
17 | MohammadHossein Bateni, Moses Charikar, Venkatesan Guruswami |
MaxMin allocation via degree lower-bounded arborescences. ![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. 543-552, 2009, ACM, 978-1-60558-506-2. The full citation details ...](Pics/full.jpeg) |
2009 |
DBLP DOI BibTeX RDF |
approximation algorithms, linear programming, graphs, lift-and-project |
17 | H. Peter Gumm |
On Minimal Coalgebras. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Appl. Categorical Struct. ![In: Appl. Categorical Struct. 16(3), pp. 313-332, 2008. The full citation details ...](Pics/full.jpeg) |
2008 |
DBLP DOI BibTeX RDF |
Mathematics Subject Classifications (2000) 18B20, 68Q85, 16W30 |
17 | Marc García-Arnau, David Pérez, Alfonso Rodríguez-Patón, Petr Sosík |
On the power of elementary features in spiking neural P systems. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Nat. Comput. ![In: Nat. Comput. 7(4), pp. 471-483, 2008. The full citation details ...](Pics/full.jpeg) |
2008 |
DBLP DOI BibTeX RDF |
Normal form, Membrane computing, P system, Spiking neuron |
17 | Kathy Buckner, Peter Cruickshank |
Social Network Analysis as a Tool to Evaluate the Effectiveness of EC Funded Networks of Excellence: The Case of DEMO-net. ![Search on Bibsonomy](Pics/bibsonomy.png) |
HICSS ![In: 41st Hawaii International International Conference on Systems Science (HICSS-41 2008), Proceedings, 7-10 January 2008, Waikoloa, Big Island, HI, USA, pp. 60, 2008, IEEE Computer Society, 0-7695-3075-3. The full citation details ...](Pics/full.jpeg) |
2008 |
DBLP DOI BibTeX RDF |
|
17 | A. N. Trahtman |
Synchronizing Road Coloring. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IFIP TCS ![In: Fifth IFIP International Conference On Theoretical Computer Science - TCS 2008, IFIP 20th World Computer Congress, TC 1, Foundations of Computer Science, September 7-10, 2008, Milano, Italy, pp. 43-53, 2008, Springer, 978-0-387-09679-7. The full citation details ...](Pics/full.jpeg) |
2008 |
DBLP DOI BibTeX RDF |
road coloring problem, synchronization, graph, deterministic finite automaton |
17 | Zeev Nutov |
Approximating Directed Weighted-Degree Constrained Networks. ![Search on Bibsonomy](Pics/bibsonomy.png) |
APPROX-RANDOM ![In: Approximation, Randomization and Combinatorial Optimization. Algorithms and Techniques, 11th International Workshop, APPROX 2008, and 12th International Workshop, RANDOM 2008, Boston, MA, USA, August 25-27, 2008. Proceedings, pp. 219-232, 2008, Springer, 978-3-540-85362-6. The full citation details ...](Pics/full.jpeg) |
2008 |
DBLP DOI BibTeX RDF |
|
17 | Daniel Bilar |
On callgraphs and generative mechanisms. ![Search on Bibsonomy](Pics/bibsonomy.png) |
J. Comput. Virol. ![In: J. Comput. Virol. 3(4), pp. 299-310, 2007. The full citation details ...](Pics/full.jpeg) |
2007 |
DBLP DOI BibTeX RDF |
|
17 | Daniel Bilar |
On callgraphs and generative mechanisms. ![Search on Bibsonomy](Pics/bibsonomy.png) |
J. Comput. Virol. ![In: J. Comput. Virol. 3(4), pp. 285-297, 2007. The full citation details ...](Pics/full.jpeg) |
2007 |
DBLP DOI BibTeX RDF |
|
17 | Angelo Monti, Paolo Penna, Riccardo Silvestri |
An Equivalent Version of the Caccetta-Häggkvist Conjecture in an Online Load Balancing Problem. ![Search on Bibsonomy](Pics/bibsonomy.png) |
WG ![In: Graph-Theoretic Concepts in Computer Science, 33rd International Workshop, WG 2007, Dornburg, Germany, June 21-23, 2007. Revised Papers, pp. 154-165, 2007, Springer, 978-3-540-74838-0. The full citation details ...](Pics/full.jpeg) |
2007 |
DBLP DOI BibTeX RDF |
Caccetta-Häggkvist conjecture, online load balancing, competitive analysis |
17 | Zhihong He, Guojun Li, Dawei Ding, Quanhui Liu |
Componentwise Complementary Cycles in Almost Regular 3-Partite Tournaments. ![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. 347-352, 2007, Springer, 978-3-540-72587-9. The full citation details ...](Pics/full.jpeg) |
2007 |
DBLP DOI BibTeX RDF |
almost regular, componentwise complementary cycles, tournament |
17 | Qizhi Fang, Rudolf Fleischer, Jian Li 0015, Xiaoxun Sun |
Algorithms for Core Stability, Core Largeness, Exactness, and Extendability of Flow Games. ![Search on Bibsonomy](Pics/bibsonomy.png) |
COCOON ![In: Computing and Combinatorics, 13th Annual International Conference, COCOON 2007, Banff, Canada, July 16-19, 2007, Proceedings, pp. 439-447, 2007, Springer, 978-3-540-73544-1. The full citation details ...](Pics/full.jpeg) |
2007 |
DBLP DOI BibTeX RDF |
|
17 | Alan Mislove, Massimiliano Marcon, P. Krishna Gummadi, Peter Druschel, Bobby Bhattacharjee |
Measurement and analysis of online social networks. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Internet Measurement Conference ![In: Proceedings of the 7th ACM SIGCOMM Internet Measurement Conference, IMC 2007, San Diego, California, USA, October 24-26, 2007, pp. 29-42, 2007, ACM, 978-1-59593-908-1. The full citation details ...](Pics/full.jpeg) |
2007 |
DBLP DOI BibTeX RDF |
social networks, measurement, analysis |
17 | László Babai |
On the diameter of Eulerian orientations of graphs. ![Search on Bibsonomy](Pics/bibsonomy.png) |
SODA ![In: Proceedings of the Seventeenth Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2006, Miami, Florida, USA, January 22-26, 2006, pp. 822-831, 2006, ACM Press, 0-89871-605-5. The full citation details ...](Pics/full.jpeg) |
2006 |
DBLP DOI BibTeX RDF |
|
17 | 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 |
17 | Vaclav Petricek, Tobias Escher, Ingemar J. Cox, Helen Z. Margetts |
The web structure of e-government - developing a methodology for quantitative evaluation. ![Search on Bibsonomy](Pics/bibsonomy.png) |
WWW ![In: Proceedings of the 15th international conference on World Wide Web, WWW 2006, Edinburgh, Scotland, UK, May 23-26, 2006, pp. 669-678, 2006, ACM, 1-59593-323-9. The full citation details ...](Pics/full.jpeg) |
2006 |
DBLP DOI BibTeX RDF |
national audit offices, webmetric, network, e-government, ranking |
17 | Haiying Shen, Cheng-Zhong Xu 0001 |
Elastic Routing Table with Provable Performance for Congestion Control in DHT Networks. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ICDCS ![In: 26th IEEE International Conference on Distributed Computing Systems (ICDCS 2006), 4-7 July 2006, Lisboa, Portugal, pp. 15, 2006, IEEE Computer Society, 0-7695-2540-7. The full citation details ...](Pics/full.jpeg) |
2006 |
DBLP DOI BibTeX RDF |
|
17 | Feng Luo 0001, Richard H. Scheuermann |
Detecting Functional Modules from Protein Interaction Networks. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IMSCCS (1) ![In: Interdisciplinary and Multidisciplinary Research in Computer Science, IEEE CS Proceeding of the First International Multi-Symposium of Computer and Computational Sciences (IMSCCS|06), June 20-24, 2006, Zhejiang University, Hangzhou, China, Vol. 1, pp. 123-130, 2006, IEEE Computer Society, 0-7695-2581-4. The full citation details ...](Pics/full.jpeg) |
2006 |
DBLP DOI BibTeX RDF |
|
17 | Mike Dodds, Detlef Plump |
Graph Transformation in Constant Time. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ICGT ![In: Graph Transformations, Third International Conference, ICGT 2006, Natal, Rio Grande do Norte, Brazil, September 17-23, 2006, Proceedings, pp. 367-382, 2006, Springer, 3-540-38870-2. The full citation details ...](Pics/full.jpeg) |
2006 |
DBLP DOI BibTeX RDF |
|
17 | Haim Kaplan, Moshe Lewenstein, Nira Shafrir, Maxim Sviridenko |
Approximation algorithms for asymmetric TSP by decomposing directed regular multigraphs. ![Search on Bibsonomy](Pics/bibsonomy.png) |
J. ACM ![In: J. ACM 52(4), pp. 602-626, 2005. The full citation details ...](Pics/full.jpeg) |
2005 |
DBLP DOI BibTeX RDF |
Approximation algorithms |
17 | 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 |
17 | Neil T. Spring, Ratul Mahajan, David Wetherall, Thomas E. Anderson |
Measuring ISP topologies with rocketfuel. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IEEE/ACM Trans. Netw. ![In: IEEE/ACM Trans. Netw. 12(1), pp. 2-16, 2004. The full citation details ...](Pics/full.jpeg) |
2004 |
DBLP DOI BibTeX RDF |
communication system operations and management, internet, measurement, network reliability |
17 | Michael P. Howarth, Sunil Iyengar, Zhili Sun, Haitham S. Cruickshank |
Dynamics of key management in secure satellite multicast. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IEEE J. Sel. Areas Commun. ![In: IEEE J. Sel. Areas Commun. 22(2), pp. 308-319, 2004. The full citation details ...](Pics/full.jpeg) |
2004 |
DBLP DOI BibTeX RDF |
|
17 | Andreas Björklund, Thore Husfeldt, Sanjeev Khanna |
Approximating Longest Directed Paths and Cycles. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ICALP ![In: Automata, Languages and Programming: 31st International Colloquium, ICALP 2004, Turku, Finland, July 12-16, 2004. Proceedings, pp. 222-233, 2004, Springer, 3-540-22849-7. The full citation details ...](Pics/full.jpeg) |
2004 |
DBLP DOI BibTeX RDF |
|
17 | Yangjun Chen |
A New Algorithm for Transitive Closures and Computation of Recursion in relational Databases. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IV ![In: Seventh International Conference on Information Visualization, IV 2003, 16-18 July 2003, London, UK, pp. 206-215, 2003, IEEE Computer Society, 0-7695-1988-1. The full citation details ...](Pics/full.jpeg) |
2003 |
DBLP DOI BibTeX RDF |
|
17 | Haim Kaplan, Moshe Lewenstein, Nira Shafrir, Maxim Sviridenko |
Approximation Algorithms for Asymmetric TSP by Decomposing Directed Regular Multigraphs. ![Search on Bibsonomy](Pics/bibsonomy.png) |
FOCS ![In: 44th Symposium on Foundations of Computer Science (FOCS 2003), 11-14 October 2003, Cambridge, MA, USA, Proceedings, pp. 56-65, 2003, IEEE Computer Society, 0-7695-2040-5. The full citation details ...](Pics/full.jpeg) |
2003 |
DBLP DOI BibTeX RDF |
|
17 | 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 |
|
17 | Jian Shen |
On the Caccetta-Häggkvist Conjecture. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Graphs Comb. ![In: Graphs Comb. 18(3), pp. 645-654, 2002. The full citation details ...](Pics/full.jpeg) |
2002 |
DBLP DOI BibTeX RDF |
|
17 | Michalis Faloutsos, Petros Faloutsos, Christos Faloutsos |
On Power-law Relationships of the Internet Topology. ![Search on Bibsonomy](Pics/bibsonomy.png) |
SIGCOMM ![In: Proceedings of the ACM SIGCOMM 1999 Conference on Applications, Technologies, Architectures, and Protocols for Computer Communication, August 30 - September 3, 1999, Cambridge, Massachusetts, USA, pp. 251-262, 1999, ACM, 1-58113-135-6. The full citation details ...](Pics/full.jpeg) |
1999 |
DBLP DOI BibTeX RDF |
|
17 | Jacques Mazoyer, Ivan Rapaport |
Additive Cellular Automata over Zp and the Bottom of (CA, <=). ![Search on Bibsonomy](Pics/bibsonomy.png) |
MFCS ![In: Mathematical Foundations of Computer Science 1998, 23rd International Symposium, MFCS'98, Brno, Czech Republic, August 24-28, 1998, Proceedings, pp. 834-843, 1998, Springer, 3-540-64827-5. The full citation details ...](Pics/full.jpeg) |
1998 |
DBLP DOI BibTeX RDF |
|
17 | Martin Fürer |
An Efficient NC Algorithm for Finding Hamiltonian Cycles in Dense Directed Graphs. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ICALP ![In: Automata, Languages and Programming, 18th International Colloquium, ICALP91, Madrid, Spain, July 8-12, 1991, Proceedings, pp. 429-440, 1991, Springer, 3-540-54233-7. The full citation details ...](Pics/full.jpeg) |
1991 |
DBLP DOI BibTeX RDF |
|
17 | 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 |
|