|
|
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 |
21 | 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 |
21 | David Avis, Bohdan Kaluzny |
Computing monotone disjoint paths on polytopes. ![Search on Bibsonomy](Pics/bibsonomy.png) |
J. Comb. Optim. ![In: J. Comb. Optim. 16(4), pp. 328-343, 2008. The full citation details ...](Pics/full.jpeg) |
2008 |
DBLP DOI BibTeX RDF |
Reverse search, Vertex enumeration, Holt-Klee, Linear programming, Network flow, Polytopes, Disjoint paths, Simplex method, Degeneracy |
21 | Yangjun Chen |
A new method for generating compressed representation of transitive closure. ![Search on Bibsonomy](Pics/bibsonomy.png) |
C3S2E ![In: Canadian Conference on Computer Science & Software Engineering, C3S2E 2008, Montreal, Quebec, Canada, May 12-13, 2008, Proceedings, pp. 229-238, 2008, ACM, 978-1-60558-101-9. The full citation details ...](Pics/full.jpeg) |
2008 |
DBLP DOI BibTeX RDF |
|
21 | Jianqin Zhou, Wenjuan Wang |
On Constructions of Optimal Double-Loop Networks. ![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. 766-774, 2008, Springer, 978-3-540-85983-3. The full citation details ...](Pics/full.jpeg) |
2008 |
DBLP DOI BibTeX RDF |
tight optimal, L-shaped tile, algorithm, Diameter, double-loop network |
21 | Deke Guo, Yunhao Liu 0001, Xiang-Yang Li 0001 |
BAKE: A Balanced Kautz Tree Structure for Peer-to-Peer Networks. ![Search on Bibsonomy](Pics/bibsonomy.png) |
INFOCOM ![In: INFOCOM 2008. 27th IEEE International Conference on Computer Communications, Joint Conference of the IEEE Computer and Communications Societies, 13-18 April 2008, Phoenix, AZ, USA, pp. 2450-2457, 2008, IEEE, 978-1-4244-2026-1. The full citation details ...](Pics/full.jpeg) |
2008 |
DBLP DOI BibTeX RDF |
|
21 | 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 |
|
21 | Gregory Z. Gutin, Igor Razgon, Eun Jung Kim 0002 |
Minimum Leaf Out-Branching Problems. ![Search on Bibsonomy](Pics/bibsonomy.png) |
AAIM ![In: Algorithmic Aspects in Information and Management, 4th International Conference, AAIM 2008, Shanghai, China, June 23-25, 2008. Proceedings, pp. 235-246, 2008, Springer, 978-3-540-68865-5. The full citation details ...](Pics/full.jpeg) |
2008 |
DBLP DOI BibTeX RDF |
|
21 | 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 |
|
21 | 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 |
21 | Massimo Melucci, Luca Pretto |
PageRank: When Order Changes. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ECIR ![In: Advances in Information Retrieval, 29th European Conference on IR Research, ECIR 2007, Rome, Italy, April 2-5, 2007, Proceedings, pp. 581-588, 2007, Springer, 978-3-540-71494-1. The full citation details ...](Pics/full.jpeg) |
2007 |
DBLP DOI BibTeX RDF |
|
21 | 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 |
21 | Kai Chen 0009, Fan Jiang 0005, Chuan-dong Huang |
A new method of generating synchronizable test sequences that detect output-shifting faults based on multiple UIO sequences. ![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. 1791-1797, 2006, ACM, 1-59593-108-2. The full citation details ...](Pics/full.jpeg) |
2006 |
DBLP DOI BibTeX RDF |
output-shifting faults, synchronization problems, distributed system, conformance testing, FSM |
21 | Kai Chen 0009, Fan Jiang 0005, Chuan-dong Huang, Zongyao Tang, Yang Qin |
Testing a Distributed System: Generating Test Sequences without Potential Controllability and Observability Problems. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ICN/ICONS/MCL ![In: Fifth International Conference on Networking and the International Conference on Systems (ICN / ICONS / MCL 2006), 23-29 April 2006, Mauritius, pp. 170, 2006, IEEE Computer Society, 0-7695-2552-0. The full citation details ...](Pics/full.jpeg) |
2006 |
DBLP DOI BibTeX RDF |
|
21 | Manuel Bodirsky, Daniel Král |
Locally Consistent Constraint Satisfaction Problems with Binary Constraints. ![Search on Bibsonomy](Pics/bibsonomy.png) |
WG ![In: Graph-Theoretic Concepts in Computer Science, 31st International Workshop, WG 2005, Metz, France, June 23-25, 2005, Revised Selected Papers, pp. 295-306, 2005, Springer, 3-540-31000-2. The full citation details ...](Pics/full.jpeg) |
2005 |
DBLP DOI BibTeX RDF |
|
21 | Chuan-dong Huang, Fan Jiang 0005 |
Generating Minimal Synchronizable Test Sequence That Detects Output-Shifting Faults. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ICCNMC ![In: Networking and Mobile Computing, Third International Conference, ICCNMC 2005, Zhangjiajie, China, August 2-4, 2005, Proceedings, pp. 1163-1170, 2005, Springer, 3-540-28102-9. The full citation details ...](Pics/full.jpeg) |
2005 |
DBLP DOI BibTeX RDF |
|
21 | Ling Chen 0005, Li Tu, Yixin Chen 0001 |
An Ant Clustering Method for a Dynamic Database. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ICMLC ![In: Advances in Machine Learning and Cybernetics, 4th International Conference, ICMLC 2005, Guangzhou, China, August 18-21, 2005, Revised Selected Papers, pp. 169-178, 2005, Springer, 3-540-33584-6. The full citation details ...](Pics/full.jpeg) |
2005 |
DBLP DOI BibTeX RDF |
|
21 | Shi-Ning Ju, Cheng-Liang Chen, Chuei-Tin Chang |
Constructing fault trees for advanced process control systems $application to cascade control loops. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IEEE Trans. Reliab. ![In: IEEE Trans. Reliab. 53(1), pp. 43-60, 2004. The full citation details ...](Pics/full.jpeg) |
2004 |
DBLP DOI BibTeX RDF |
|
21 | Jørgen Bang-Jensen, Anders Yeo |
Decomposing k-arc-Strong Tournaments Into Strong Spanning Subdigraphs. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Comb. ![In: Comb. 24(3), pp. 331-349, 2004. The full citation details ...](Pics/full.jpeg) |
2004 |
DBLP DOI BibTeX RDF |
Mathematics Subject Classification (2000): 05C20, 05C70, 05C38, 05C40 |
21 | Mikkel Thorup |
Compact oracles for reachability and approximate distances in planar digraphs. ![Search on Bibsonomy](Pics/bibsonomy.png) |
J. ACM ![In: J. ACM 51(6), pp. 993-1024, 2004. The full citation details ...](Pics/full.jpeg) |
2004 |
DBLP DOI BibTeX RDF |
reachability and shortest paths oracles, Planar graphs |
21 | Harold N. Gabow |
Special edges, and approximating the smallest directed k-edge connected spanning subgraph. ![Search on Bibsonomy](Pics/bibsonomy.png) |
SODA ![In: Proceedings of the Fifteenth Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2004, New Orleans, Louisiana, USA, January 11-14, 2004, pp. 234-243, 2004, SIAM, 0-89871-558-X. The full citation details ...](Pics/full.jpeg) |
2004 |
DBLP BibTeX RDF |
|
21 | Raphael Yuster, Uri Zwick |
Detecting short directed cycles using rectangular matrix multiplication and dynamic programming. ![Search on Bibsonomy](Pics/bibsonomy.png) |
SODA ![In: Proceedings of the Fifteenth Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2004, New Orleans, Louisiana, USA, January 11-14, 2004, pp. 254-260, 2004, SIAM, 0-89871-558-X. The full citation details ...](Pics/full.jpeg) |
2004 |
DBLP BibTeX RDF |
|
21 | Zeev Nutov, Raphael Yuster |
Packing Directed Cycles Efficiently. ![Search on Bibsonomy](Pics/bibsonomy.png) |
MFCS ![In: Mathematical Foundations of Computer Science 2004, 29th International Symposium, MFCS 2004, Prague, Czech Republic, August 22-27, 2004, Proceedings, pp. 310-321, 2004, Springer, 3-540-22823-3. The full citation details ...](Pics/full.jpeg) |
2004 |
DBLP DOI BibTeX RDF |
|
21 | Pierre Fraigniaud, David Ilcinkas |
Digraphs Exploration with Little Memory. ![Search on Bibsonomy](Pics/bibsonomy.png) |
STACS ![In: STACS 2004, 21st Annual Symposium on Theoretical Aspects of Computer Science, Montpellier, France, March 25-27, 2004, Proceedings, pp. 246-257, 2004, Springer, 3-540-21236-1. The full citation details ...](Pics/full.jpeg) |
2004 |
DBLP DOI BibTeX RDF |
|
21 | John A. Rose, Mitsunori Takano, Masami Hagiya, Akira Suyama |
A DNA Computing-based Genetic Program for In Vitro Protein Evolution via Constrained Pseudomodule Shuffling. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Genet. Program. Evolvable Mach. ![In: Genet. Program. Evolvable Mach. 4(2), pp. 139-152, 2003. The full citation details ...](Pics/full.jpeg) |
2003 |
DBLP DOI BibTeX RDF |
|
21 | Béla Bollobás, Don Coppersmith, Michael Elkin |
Sparse distance preservers and additive spanners. ![Search on Bibsonomy](Pics/bibsonomy.png) |
SODA ![In: Proceedings of the Fourteenth Annual ACM-SIAM Symposium on Discrete Algorithms, January 12-14, 2003, Baltimore, Maryland, USA., pp. 414-423, 2003, ACM/SIAM, 0-89871-538-5. The full citation details ...](Pics/full.jpeg) |
2003 |
DBLP BibTeX RDF |
|
21 | 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 |
|
21 | Lars Arge, Laura Toma, Norbert Zeh |
I/O-efficient topological sorting of planar DAGs. ![Search on Bibsonomy](Pics/bibsonomy.png) |
SPAA ![In: SPAA 2003: Proceedings of the Fifteenth Annual ACM Symposium on Parallelism in Algorithms and Architectures, June 7-9, 2003, San Diego, California, USA (part of FCRC 2003), pp. 85-93, 2003, ACM, 1-58113-661-7. The full citation details ...](Pics/full.jpeg) |
2003 |
DBLP DOI BibTeX RDF |
I/O-efficient algorithms, planar directed graphs, graph algorithms, topological sorting, ear decomposition |
21 | Wen-Huei Chen, Cho-Ching Lu |
Executable test sequence for the protocol control and data flow property with overlapping. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ISCC ![In: Proceedings of the Seventh IEEE Symposium on Computers and Communications (ISCC 2002), 1-4 July 2002, Taormina, Italy, pp. 251-257, 2002, IEEE Computer Society, 0-7695-1671-8. The full citation details ...](Pics/full.jpeg) |
2002 |
DBLP DOI BibTeX RDF |
SCP tour, Conformance testing, EFSM |
21 | 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 |
|
21 | Surender Baswana, Ramesh Hariharan, Sandeep Sen |
Improved decremental algorithms for maintaining transitive closure and all-pairs shortest paths. ![Search on Bibsonomy](Pics/bibsonomy.png) |
STOC ![In: Proceedings on 34th Annual ACM Symposium on Theory of Computing, May 19-21, 2002, Montréal, Québec, Canada, pp. 117-123, 2002, ACM, 1-58113-495-9. The full citation details ...](Pics/full.jpeg) |
2002 |
DBLP DOI BibTeX RDF |
BFS tree, decremental, reachability |
21 | Jaime D. L. Caro, Tedros Weldemicael Zeratsion |
On the Diameter of a Class of the Generalized de Bruijn Graphs. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ISPAN ![In: International Symposium on Parallel Architectures, Algorithms and Networks, ISPAN 2002, May 22-24, 2002, Makati City, Metro Manila, Philippines, pp. 225-, 2002, IEEE Computer Society, 0-7695-1579-7. The full citation details ...](Pics/full.jpeg) |
2002 |
DBLP DOI BibTeX RDF |
|
21 | Robert T. Firla, Bianca Spille, Robert Weismantel |
Algorithmic Characterization of Bipartite b-Matching and Matroid Intersection. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Combinatorial Optimization ![In: Combinatorial Optimization - Eureka, You Shrink!, Papers Dedicated to Jack Edmonds, 5th International Workshop, Aussois, France, March 5-9, 2001, Revised Papers, pp. 48-63, 2001, Springer, 3-540-00580-3. The full citation details ...](Pics/full.jpeg) |
2001 |
DBLP DOI BibTeX RDF |
|
21 | David Coudert, Afonso Ferreira, Stephane Perennes |
De Bruijn Isomorphisms and Free Space Optical Networks. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IPDPS ![In: Proceedings of the 14th International Parallel & Distributed Processing Symposium (IPDPS'00), Cancun, Mexico, May 1-5, 2000, pp. 769-774, 2000, IEEE Computer Society. The full citation details ...](Pics/full.jpeg) |
2000 |
DBLP DOI BibTeX RDF |
|
21 | James Abello, Jeffrey L. Korn |
Visualizing Massive Multi-Digraphs. ![Search on Bibsonomy](Pics/bibsonomy.png) |
INFOVIS ![In: IEEE Symposium on Information Visualization 2000 (INFOVIS'00), Salt Lake City, Utah, USA, October 9-10, 2000., pp. 39-47, 2000, IEEE Computer Society, 0-7695-0804-9. The full citation details ...](Pics/full.jpeg) |
2000 |
DBLP DOI BibTeX RDF |
visualization, graphs, hierarchies, out-of-core algorithms, massive data sets |
21 | Dora Giammarresi, Jean-Luc Ponty, Derick Wood |
Thompson Digraphs: A Characterization. ![Search on Bibsonomy](Pics/bibsonomy.png) |
WIA ![In: Automata Implementation, 4th International Workshop on Implementing Automata, WIA'99, Potsdam, Germany, July 17-19, 1999, Revised Papers, pp. 91-100, 1999, Springer, 3-540-42812-7. The full citation details ...](Pics/full.jpeg) |
1999 |
DBLP DOI BibTeX RDF |
|
21 | Daniela Ferrero |
A Technique for the (d, s, N)-Bus Network Problem. ![Search on Bibsonomy](Pics/bibsonomy.png) |
SCCC ![In: 19th International Conference of the Chilean Computer Science Society (SCCC '99), 11-13 November 1999, Talca, Chile, pp. 129-135, 1999, IEEE Computer Society, 0-7695-0296-2. The full citation details ...](Pics/full.jpeg) |
1999 |
DBLP DOI BibTeX RDF |
|
21 | Mariusz Meszka, Zdzislaw Skupien |
Self-Converse and Oriented Graphs among the Third Parts of Nearly Complete Digraphs. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Comb. ![In: Comb. 18(3), pp. 413-424, 1998. The full citation details ...](Pics/full.jpeg) |
1998 |
DBLP DOI BibTeX RDF |
AMS Subject Classification (1991) Classes: 05C70, 05C20 |
21 | Yih-Lang Li, Cheng-Wen Wu |
Cellular automata for efficient parallel logic and fault simulation. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IEEE Trans. Comput. Aided Des. Integr. Circuits Syst. ![In: IEEE Trans. Comput. Aided Des. Integr. Circuits Syst. 14(6), pp. 740-749, 1995. The full citation details ...](Pics/full.jpeg) |
1995 |
DBLP DOI BibTeX RDF |
|
21 | Zhijian Zhu, James A. McHugh, Jason T. L. Wang, Peter A. Ng |
A formal approach to modeling office information systems. ![Search on Bibsonomy](Pics/bibsonomy.png) |
J. Syst. Integr. ![In: J. Syst. Integr. 4(4), pp. 373-403, 1994. The full citation details ...](Pics/full.jpeg) |
1994 |
DBLP DOI BibTeX RDF |
office information systems, document type, filing and retrieval, directed acyclic graph, predicates, document model |
21 | Hristo N. Djidjev, Grammati E. Pantziou, Christos D. Zaroliagis |
Computing Shortest Paths and Distances in Planar 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. 327-338, 1991, Springer, 3-540-54233-7. The full citation details ...](Pics/full.jpeg) |
1991 |
DBLP DOI BibTeX RDF |
|
21 | Klaus Simon |
An Improved Algorithm for Transitive Closure on Acyclic Digraphs. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ICALP ![In: Automata, Languages and Programming, 13th International Colloquium, ICALP86, Rennes, France, July 15-19, 1986, Proceedings, pp. 376-386, 1986, Springer, 3-540-16761-7. The full citation details ...](Pics/full.jpeg) |
1986 |
DBLP DOI BibTeX RDF |
|
21 | Alfs T. Berztiss |
A Backtrack Procedure for Isomorphism of Directed Graphs. ![Search on Bibsonomy](Pics/bibsonomy.png) |
J. ACM ![In: J. ACM 20(3), pp. 365-377, 1973. The full citation details ...](Pics/full.jpeg) |
1973 |
DBLP DOI BibTeX RDF |
|
19 | Derrick Stolee, Chris Bourke, N. V. Vinodchandran |
A Log-Space Algorithm for Reachability in Planar Acyclic Digraphs with Few Sources. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CCC ![In: Proceedings of the 25th Annual IEEE Conference on Computational Complexity, CCC 2010, Cambridge, Massachusetts, USA, June 9-12, 2010, pp. 131-138, 2010, IEEE Computer Society, 978-0-7695-4060-3. The full citation details ...](Pics/full.jpeg) |
2010 |
DBLP DOI BibTeX RDF |
acyclic digraph, logspace algorithm, planar graph, reachability |
19 | Hubertus Th. Jongen, Alina Ruíz Jhones |
Topology of Global Optimization. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Encyclopedia of Optimization ![In: Encyclopedia of Optimization, Second Edition, pp. 3922-3928, 2009, Springer, 978-0-387-74758-3. The full citation details ...](Pics/full.jpeg) |
2009 |
DBLP DOI BibTeX RDF |
Karush-Kuhn-Tucker point, Morse relations, Euler formula, Continuous selection of functions, Min-max graph, Min-max digraph, Projected positive gradient, Projected negative gradient, Ascent flow, Descent flow, Global optimization, Morse theory |
19 | Paul Tarau |
An embedded declarative data transformation language. ![Search on Bibsonomy](Pics/bibsonomy.png) |
PPDP ![In: Proceedings of the 11th International ACM SIGPLAN Conference on Principles and Practice of Declarative Programming, September 7-9, 2009, Coimbra, Portugal, pp. 171-182, 2009, ACM, 978-1-60558-568-0. The full citation details ...](Pics/full.jpeg) |
2009 |
DBLP DOI BibTeX RDF |
computational mathematics, dag and hypergraph encodings, functions and permutations, goedel numberings, hereditarily finite sets, pairing functions, prolog data representations, ranking/unranking bijections, digraph |
19 | Nicolas Beldiceanu, Pierre Flener, Xavier Lorca |
Combining Tree Partitioning, Precedence, and Incomparability Constraints. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Constraints An Int. J. ![In: Constraints An Int. J. 13(4), pp. 459-489, 2008. The full citation details ...](Pics/full.jpeg) |
2008 |
DBLP DOI BibTeX RDF |
Digraph partitioning, Tree constraint, Incomparability constraint, Ordered disjoint paths problem, Phylogenetic supertree problem, Filtering, Tree, Global constraint, Precedence constraint, Hamiltonian path problem |
19 | Gábor Kun, Jaroslav Nesetril |
NP by Means of Lifts and Shadows. ![Search on Bibsonomy](Pics/bibsonomy.png) |
MFCS ![In: Mathematical Foundations of Computer Science 2007, 32nd International Symposium, MFCS 2007, Ceský Krumlov, Czech Republic, August 26-31, 2007, Proceedings, pp. 171-181, 2007, Springer, 978-3-540-74455-9. The full citation details ...](Pics/full.jpeg) |
2007 |
DBLP DOI BibTeX RDF |
duality, Constraint Satisfaction Problem, homomorphism, Digraph, NP |
19 | Kono Kim, Yeohoon Yoon, Harksoo Kim, Jungyun Seo |
Named Entity Recognition Using Acyclic Weighted Digraphs: A Semi-supervised Statistical Method. ![Search on Bibsonomy](Pics/bibsonomy.png) |
PAKDD ![In: Advances in Knowledge Discovery and Data Mining, 11th Pacific-Asia Conference, PAKDD 2007, Nanjing, China, May 22-25, 2007, Proceedings, pp. 571-578, 2007, Springer, 978-3-540-71700-3. The full citation details ...](Pics/full.jpeg) |
2007 |
DBLP DOI BibTeX RDF |
semi-supervised statistical method, acyclic weighted digraph, named entity recognition |
19 | Glen-Brug Guenver, Jimmy Leblet, Jean-Xavier Rampon |
Chain Dominated Orders. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Order ![In: Order 23(2-3), pp. 109-127, 2006. The full citation details ...](Pics/full.jpeg) |
2006 |
DBLP DOI BibTeX RDF |
covering relation, jump number, transitive reduction, truncated lattice, visibility relation, dimension, partially ordered set, digraph, convex set, interval order |
19 | M. G. Karunambigai, Appu Muthusamy |
On Resolvable Multipartite G-Designs II. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Graphs Comb. ![In: Graphs Comb. 22(1), pp. 59-67, 2006. The full citation details ...](Pics/full.jpeg) |
2006 |
DBLP DOI BibTeX RDF |
Cycle-factorization, Wreath product of graphs, Complete symmetric k?partite multi-digraph, Resolvable multipartite G -design |
19 | 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 |
19 | M. Giraudet, John Kenneth Truss |
Okhuma Graphs and Coloured Chains. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Order ![In: Order 21(4), pp. 265-281, 2004. The full citation details ...](Pics/full.jpeg) |
2004 |
DBLP DOI BibTeX RDF |
Okhuma, uniquely transitive, graph, digraph, chain, colour |
19 | Bruno Bachelet, Philippe Mahey |
Minimum convex piecewise linear cost tension problem on quasi-k series-parallel graphs. ![Search on Bibsonomy](Pics/bibsonomy.png) |
4OR ![In: 4OR 2(4), pp. 275-291, 2004. The full citation details ...](Pics/full.jpeg) |
2004 |
DBLP DOI BibTeX RDF |
Minimum cost tension, two-terminal series-parallel digraph, series-parallel recognition, out-of-kilter algorithm, graph decomposition |
19 | Josep M. Brunat, Antonio Montes |
The characteristic ideal of a finite, connected, regular graph. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ISSAC ![In: Symbolic and Algebraic Computation, International Symposium ISSAC 2004, Santander, Spain, July 4-7, 2004, Proceedings, pp. 50-57, 2004, ACM, 1-58113-827-X. The full citation details ...](Pics/full.jpeg) |
2004 |
DBLP DOI BibTeX RDF |
characteristic ideal, galois graph, polynomial digraph, polynomial graph, strongly polynomial graph, variety of a pairing, pairing, connected component, conjecture |
19 | Byron Dom, Iris Eiron, Alex Cozzi, Yi Zhang |
Graph-based ranking algorithms for e-mail expertise analysis. ![Search on Bibsonomy](Pics/bibsonomy.png) |
DMKD ![In: Proceedings of the 8th ACM SIGMOD workshop on Research issues in data mining and knowledge discovery, DMKD 2003, San Diego, California, USA, June 13, 2003, pp. 42-48, 2003, ACM. The full citation details ...](Pics/full.jpeg) |
2003 |
DBLP DOI BibTeX RDF |
digraph node ranking, ordered list distance, social network analysis, expert finding |
19 | Guoping Liu 0004, Kyungsook Y. Lee, Harry F. Jordan |
n-Dimensional Processor Arrays with Optical dBuses. ![Search on Bibsonomy](Pics/bibsonomy.png) |
J. Supercomput. ![In: J. Supercomput. 16(3), pp. 149-163, 2000. The full citation details ...](Pics/full.jpeg) |
2000 |
DBLP DOI BibTeX RDF |
de Bruijn digraph, wavelength division multiplexing, optical interconnections, processor array, time division multiplexing |
19 | Harold N. Gabow |
Using Expander Graphs to Find Vertex Connectivity. ![Search on Bibsonomy](Pics/bibsonomy.png) |
FOCS ![In: 41st Annual Symposium on Foundations of Computer Science, FOCS 2000, 12-14 November 2000, Redondo Beach, California, USA, pp. 410-420, 2000, IEEE Computer Society, 0-7695-0850-2. The full citation details ...](Pics/full.jpeg) |
2000 |
DBLP DOI BibTeX RDF |
nesting properties, separation triples, computational complexity, complexity, graph theory, expander graphs, undirected graph, digraph, time bound, vertex connectivity |
19 | I. Scott MacKenzie, Shawn X. Zhang |
The Design and Evaluation of a High-Performance Soft Keyboard. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CHI ![In: Proceeding of the CHI '99 Conference on Human Factors in Computing Systems: The CHI is the Limit, Pittsburgh, PA, USA, May 15-20, 1999., pp. 25-31, 1999, ACM, 0-201-48559-1. The full citation details ...](Pics/full.jpeg) |
1999 |
DBLP DOI BibTeX RDF |
digraph probabilities, linguistic models, Fitts' law, mobile systems, pen input, soft keyboards, stylus input |
19 | H. E. Escuardro, Felix P. Muga II |
Wide-diameter of generalized undirected de Bruijn graph UGB(n, n2). ![Search on Bibsonomy](Pics/bibsonomy.png) |
ISPAN ![In: 1997 International Symposium on Parallel Architectures, Algorithms and Networks (ISPAN '97), 18-20 December 1997, Taipei, Taiwan, pp. 417-420, 1997, IEEE Computer Society, 0-8186-8259-0. The full citation details ...](Pics/full.jpeg) |
1997 |
DBLP DOI BibTeX RDF |
undirected, graph theory, digraph, de Bruijn graph, wide-diameter |
19 | Monika Rauch Henzinger, Satish Rao, Harold N. Gabow |
Computing Vertex Connectivity: New Bounds from Old Techniques. ![Search on Bibsonomy](Pics/bibsonomy.png) |
FOCS ![In: 37th Annual Symposium on Foundations of Computer Science, FOCS '96, Burlington, Vermont, USA, 14-16 October, 1996, pp. 462-471, 1996, IEEE Computer Society, 0-8186-7594-2. The full citation details ...](Pics/full.jpeg) |
1996 |
DBLP DOI BibTeX RDF |
smallest number of vertices, preflow push algorithm, computational geometry, deterministic algorithm, digraph, error probability, vertex connectivity |
19 | David Eppstein |
Finding the k Shortest Paths ![Search on Bibsonomy](Pics/bibsonomy.png) |
FOCS ![In: 35th Annual Symposium on Foundations of Computer Science, Santa Fe, New Mexico, USA, 20-22 November 1994, pp. 154-165, 1994, IEEE Computer Society, 0-8186-6580-7. The full citation details ...](Pics/full.jpeg) |
1994 |
DBLP DOI BibTeX RDF |
maximum inscribed polygons, implicit representation, dynamic programming problems, algorithms, sequence alignment, knapsack problem, vertices, digraph, k shortest paths |
19 | Nen-Fu Huang |
On the Complexity of Two Circle Strongly Connecting Problems. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IEEE Trans. Computers ![In: IEEE Trans. Computers 41(9), pp. 1185-1188, 1992. The full citation details ...](Pics/full.jpeg) |
1992 |
DBLP DOI BibTeX RDF |
circle strongly connecting problems, demand points, directed edge, computational complexity, approximation algorithm, complexity, computational geometry, NP-hard, directed graphs, digraph, plane, radius |
19 | Klaus Simon |
On Minimum Flow and Transitive Reduction. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ICALP ![In: Automata, Languages and Programming, 15th International Colloquium, ICALP88, Tampere, Finland, July 11-15, 1988, Proceedings, pp. 535-546, 1988, Springer, 3-540-19488-6. The full citation details ...](Pics/full.jpeg) |
1988 |
DBLP DOI BibTeX RDF |
Minimum flow, transitive reduction, random digraph, transitive closure |
19 | Kyung-Yong Chwa, S. Louis Hakimi |
On Fault Identification in Diagnosable Systems. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IEEE Trans. Computers ![In: IEEE Trans. Computers 30(6), pp. 414-422, 1981. The full citation details ...](Pics/full.jpeg) |
1981 |
DBLP DOI BibTeX RDF |
t-diagnosable systems, Characterization of t/t-diagnosable systems, digraph model, fault diagnosis, diagnosis algorithms, system diagnosis |
19 | Frank DeRemer, Thomas J. Pennello |
Efficient computation of LALR(1) look-ahead sets. ![Search on Bibsonomy](Pics/bibsonomy.png) |
SIGPLAN Symposium on Compiler Construction ![In: Proceedings of the 1979 SIGPLAN Symposium on Compiler Construction, Denver, Colorado, USA, August 6-10, 1979, pp. 176-187, 1979, ACM, 0-89791-002-8. The full citation details ...](Pics/full.jpeg) |
1979 |
DBLP DOI BibTeX RDF |
LALR(k) grammar, LR(k), Parser, Digraph, Syntactic analysis, Strongly-connected component, Look-ahead, Context-free |
19 | Thomas J. Pennello, Frank DeRemer |
Efficient computation of LALR(1) look-ahead sets (with retrospective) ![Search on Bibsonomy](Pics/bibsonomy.png) |
Best of PLDI ![In: 20 Years of the ACM SIGPLAN Conference on Programming Language Design and Implementation 1979-1999, A Selection, pp. 14-27, 1979, ACM, 1-58113-623-4. The full citation details ...](Pics/full.jpeg) |
1979 |
DBLP DOI BibTeX RDF |
LALR(k) grammar, LR(k), parser, digraph, syntactic analysis, strongly-connected component, look-ahead, context-free |
16 | Pierre Aboulker, Quentin Vermande |
Various Bounds on the Minimum Number of Arcs in a $k$-Dicritical Digraph. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Electron. J. Comb. ![In: Electron. J. Comb. 31(1), 2024. The full citation details ...](Pics/full.jpeg) |
2024 |
DBLP DOI BibTeX RDF |
|
16 | Nicolas Bousquet, Frédéric Havet, Nicolas Nisse, Lucas Picasarri-Arrieta, Amadeus Reinald |
Digraph redicolouring. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Eur. J. Comb. ![In: Eur. J. Comb. 116, pp. 103876, February 2024. The full citation details ...](Pics/full.jpeg) |
2024 |
DBLP DOI BibTeX RDF |
|
16 | Xiaojun Zhao, Qingying Deng, Xiaowang Li |
Relating g-good-neighbor connectivity and g-good-neighbor diagnosability of strong digraph network. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Theor. Comput. Sci. ![In: Theor. Comput. Sci. 982, pp. 114258, January 2024. The full citation details ...](Pics/full.jpeg) |
2024 |
DBLP DOI BibTeX RDF |
|
16 | Florian Hörsch, Lucas Picasarri-Arrieta |
Complexity results on the decomposition of a digraph into directed linear forests and out-stars. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CoRR ![In: CoRR abs/2401.09202, 2024. The full citation details ...](Pics/full.jpeg) |
2024 |
DBLP DOI BibTeX RDF |
|
16 | Xunkai Li, Meihao Liao, Zhengyu Wu, Daohan Su, Wentao Zhang, Rong-Hua Li, Guoren Wang |
LightDiC: A Simple yet Effective Approach for Large-scale Digraph Representation Learning. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CoRR ![In: CoRR abs/2401.11772, 2024. The full citation details ...](Pics/full.jpeg) |
2024 |
DBLP DOI BibTeX RDF |
|
16 | Xunkai Li, Meihao Liao, Zhengyu Wu, Daohan Su, Wentao Zhang, Ronghua Li, Guoren Wang |
LightDiC: A Simple yet Effective Approach for Large-scale Digraph Representation Learning. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Proc. VLDB Endow. ![In: Proc. VLDB Endow. 17(7), pp. 1542-1551, March 2024. The full citation details ...](Pics/full.jpeg) |
2024 |
DBLP BibTeX RDF |
|
16 | Suneet Singh, Akhilesh Barve, Kamalakanta Muduli, Anil Kumar 0008, Sunil Luthra |
Evaluating Roadblocks to Implementing a Green Freight Transportation System: An Interval Valued Intuitionistic Fuzzy Digraph Matrix Approach. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IEEE Trans. Engineering Management ![In: IEEE Trans. Engineering Management 71, pp. 2758-2771, 2024. The full citation details ...](Pics/full.jpeg) |
2024 |
DBLP DOI BibTeX RDF |
|
16 | Mouhamad El Joubbeh, Salman Ghazal |
Existence of paths with t blocks in k(t)-chromatic digraph. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Discret. Appl. Math. ![In: Discret. Appl. Math. 342, pp. 381-384, January 2024. The full citation details ...](Pics/full.jpeg) |
2024 |
DBLP DOI BibTeX RDF |
|
16 | 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 |
|
16 | Danyang Wang, Ping Zhu 0001 |
Fuzzy rough digraph based on strength of connectedness with application. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Neural Comput. Appl. ![In: Neural Comput. Appl. 35(16), pp. 11847-11866, June 2023. The full citation details ...](Pics/full.jpeg) |
2023 |
DBLP DOI BibTeX RDF |
|
16 | Stephan Dominique Andres |
Strong and weak Perfect Digraph Theorems for perfect, α-perfect and strictly perfect digraphs. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Discuss. Math. Graph Theory ![In: Discuss. Math. Graph Theory 43(4), pp. 909-930, 2023. The full citation details ...](Pics/full.jpeg) |
2023 |
DBLP DOI BibTeX RDF |
|
16 | Junyi Guan, Sheng Li 0005, Xiongxiong He, Jiajia Chen |
Clustering by fast detection of main density peaks within a peak digraph. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Inf. Sci. ![In: Inf. Sci. 628, pp. 504-521, May 2023. The full citation details ...](Pics/full.jpeg) |
2023 |
DBLP DOI BibTeX RDF |
|
16 | Weihua Li 0009, Huaguang Zhang, Yunfei Mu, Yingchun Wang |
Bipartite Time-Varying Output Formation Tracking for Multiagent Systems With Multiple Heterogeneous Leaders Under Signed Digraph. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IEEE Trans. Ind. Informatics ![In: IEEE Trans. Ind. Informatics 19(11), pp. 11070-11079, November 2023. The full citation details ...](Pics/full.jpeg) |
2023 |
DBLP DOI BibTeX RDF |
|
16 | Yan Zhang, Guojiang Shen, Xiao Han 0004, Wei Wang 0077, Xiangjie Kong 0001 |
Spatio-Temporal Digraph Convolutional Network-Based Taxi Pickup Location Recommendation. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IEEE Trans. Ind. Informatics ![In: IEEE Trans. Ind. Informatics 19(1), pp. 394-403, 2023. The full citation details ...](Pics/full.jpeg) |
2023 |
DBLP DOI BibTeX RDF |
|
16 | Yiling Dong |
Precise Values for the Strong Subgraph 3-Arc-Connectivity of Cartesian Products of Some Digraph Classes. ![Search on Bibsonomy](Pics/bibsonomy.png) |
J. Interconnect. Networks ![In: J. Interconnect. Networks 23(1), pp. 2150036:1-2150036:17, 2023. The full citation details ...](Pics/full.jpeg) |
2023 |
DBLP DOI BibTeX RDF |
|
16 | Hilal A. Ganie, Yilun Shang |
On the Laplacian and Signless Laplacian Characteristic Polynomials of a Digraph. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Symmetry ![In: Symmetry 15(1), pp. 52, 2023. The full citation details ...](Pics/full.jpeg) |
2023 |
DBLP DOI BibTeX RDF |
|
16 | Hong Wang 0005, Yun Wang, Jin Yan |
Disjoint Cycles in a Digraph with Partial Degree. ![Search on Bibsonomy](Pics/bibsonomy.png) |
SIAM J. Discret. Math. ![In: SIAM J. Discret. Math. 37(1), pp. 221-232, March 2023. The full citation details ...](Pics/full.jpeg) |
2023 |
DBLP DOI BibTeX RDF |
|
16 | Florian Bridoux, Kévin Perrot, Aymeric Picard Marchetto, Adrien Richard |
Interaction graphs of isomorphic automata networks I: Complete digraph and minimum in-degree. ![Search on Bibsonomy](Pics/bibsonomy.png) |
J. Comput. Syst. Sci. ![In: J. Comput. Syst. Sci. 138, pp. 103458, December 2023. The full citation details ...](Pics/full.jpeg) |
2023 |
DBLP DOI BibTeX RDF |
|
16 | Lucas Picasarri-Arrieta |
Strengthening the Directed Brooks' Theorem for oriented graphs and consequences on digraph redicolouring. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CoRR ![In: CoRR abs/2301.04881, 2023. The full citation details ...](Pics/full.jpeg) |
2023 |
DBLP DOI BibTeX RDF |
|
16 | 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 |
|
16 | Amanul Islam, Fazidah Othman, Nazmus Sakib, Hafiz Md. Hasan Babu |
Prevention of shoulder-surfing attacks using shifting condition using digraph substitution rules. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CoRR ![In: CoRR abs/2305.06549, 2023. The full citation details ...](Pics/full.jpeg) |
2023 |
DBLP DOI BibTeX RDF |
|
16 | Julien Duron, Frédéric Havet, Florian Hörsch, Clément Rambaud |
On the minimum number of inversions to make a digraph k-(arc-)strong. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CoRR ![In: CoRR abs/2303.11719, 2023. The full citation details ...](Pics/full.jpeg) |
2023 |
DBLP DOI BibTeX RDF |
|
16 | Hyungsoo Kang, Isaac Kaminer, Venanzio Cichella, Naira Hovakimyan |
Coordinated Path Following of UAVs using Event-Triggered Communication over Time-Varying Networks with Digraph Topologies. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CoRR ![In: CoRR abs/2307.06961, 2023. The full citation details ...](Pics/full.jpeg) |
2023 |
DBLP DOI BibTeX RDF |
|
16 | Nicolas Bousquet, Frédéric Havet, Nicolas Nisse, Lucas Picasarri-Arrieta, Amadeus Reinald |
Digraph redicolouring. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CoRR ![In: CoRR abs/2301.03417, 2023. The full citation details ...](Pics/full.jpeg) |
2023 |
DBLP DOI BibTeX RDF |
|
16 | Pierre Aboulker, Guillaume Aubian, Pierre Charbit |
Digraph Colouring and Arc-Connectivity. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CoRR ![In: CoRR abs/2304.04690, 2023. The full citation details ...](Pics/full.jpeg) |
2023 |
DBLP DOI BibTeX RDF |
|
16 | Argyrios Deligkas, Eduard Eiben, Gregory Z. Gutin, Philip R. Neary, Anders Yeo |
Complexity Dichotomies for the Maximum Weighted Digraph Partition Problem. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CoRR ![In: CoRR abs/2307.01109, 2023. The full citation details ...](Pics/full.jpeg) |
2023 |
DBLP DOI BibTeX RDF |
|
16 | Florian Bridoux, Kévin Perrot, Aymeric Picard Marchetto, Adrien Richard |
Interaction graphs of isomorphic automata networks I: complete digraph and minimum in-degree. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CoRR ![In: CoRR abs/2301.01958, 2023. The full citation details ...](Pics/full.jpeg) |
2023 |
DBLP DOI BibTeX RDF |
|
16 | Sayani Ghosh, Bradley S. Meyer |
Digraph Branchings and Matrix Determinants. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CoRR ![In: CoRR abs/2309.05827, 2023. The full citation details ...](Pics/full.jpeg) |
2023 |
DBLP DOI BibTeX RDF |
|
16 | Deva Nithyanandham, Felix Augustin, David Raj Micheal, Nagarajan Deivanayagam Pillai |
Energy based bipolar intuitionistic fuzzy digraph decision-making system in selecting COVID-19 vaccines. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Appl. Soft Comput. ![In: Appl. Soft Comput. 147, pp. 110793, November 2023. The full citation details ...](Pics/full.jpeg) |
2023 |
DBLP DOI BibTeX RDF |
|
16 | Ruijuan Gu, Hui Lei 0002, Xiaopan Lian, Zhenyu Taoqiu |
Weak-odd chromatic index of special digraph classes. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Discret. Appl. Math. ![In: Discret. Appl. Math. 325, pp. 79-86, 2023. The full citation details ...](Pics/full.jpeg) |
2023 |
DBLP DOI BibTeX RDF |
|
16 | Shuya Chiba |
Partitioning the vertices of a digraph into directed cycles and degenerated directed cycles. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Discret. Appl. Math. ![In: Discret. Appl. Math. 330, pp. 1-13, May 2023. The full citation details ...](Pics/full.jpeg) |
2023 |
DBLP DOI BibTeX RDF |
|
16 | Yonglin Hao, Qingju Wang 0001, Lin Jiao, Xinxin Gong |
Approximate Modeling of Signed Difference and Digraph based Bit Condition Deduction: New Boomerang Attacks on BLAKE. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IACR Cryptol. ePrint Arch. ![In: IACR Cryptol. ePrint Arch. 2023, pp. 299, 2023. The full citation details ...](Pics/full.jpeg) |
2023 |
DBLP BibTeX RDF |
|
16 | Yue Fan, Huiwen Wang, Lihong Wang, Shu Guo, Jing Liu |
A novel trajectory similarity measurement method based on node-sequence hierarchical digraph. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Trans. GIS ![In: Trans. GIS 27(8), pp. 2320-2342, December 2023. The full citation details ...](Pics/full.jpeg) |
2023 |
DBLP DOI BibTeX RDF |
|
16 | Mattia G. Bergomi, Massimo Ferri |
Exploring Graph and Digraph Persistence. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Algorithms ![In: Algorithms 16(10), pp. 465, 2023. The full citation details ...](Pics/full.jpeg) |
2023 |
DBLP DOI BibTeX RDF |
|
Displaying result #101 - #200 of 893 (100 per page; Change: ) Pages: [ <<][ 1][ 2][ 3][ 4][ 5][ 6][ 7][ 8][ 9][ >>] |
|