|
|
Venues (Conferences, Journals, ...)
|
|
GrowBag graphs for keyword ? (Num. hits/coverage)
Group by:
The graphs summarize 111 occurrences of 102 keywords
|
|
|
Results
Found 125 publication records. Showing 125 according to the selection in the facets
Hits ?▲ |
Authors |
Title |
Venue |
Year |
Link |
Author keywords |
75 | Md. Jawaherul Alam, Md. Abul Hassan Samee, Mashfiqui Rabbi, Md. Saidur Rahman 0001 |
Upward Drawings of Trees on the Minimum Number of Layers. ![Search on Bibsonomy](Pics/bibsonomy.png) |
WALCOM ![In: WALCOM: Algorithms and Computation, Second International Workshop, WALCOM 2008, Dhaka, Bangladesh, February 7-8, 2008., pp. 88-99, 2008, Springer, 978-3-540-77890-5. The full citation details ...](Pics/full.jpeg) |
2008 |
DBLP DOI BibTeX RDF |
Planar Drawing, k-layer Planar Drawing, Upward Drawing, Minimum Layer Upward Drawing, Algorithm, Trees, Line-labeling, Straight-line Drawing |
65 | Kazunori Yamagata, Tomoyuki Uchida, Takayoshi Shoudai, Yasuaki Nakamura |
An Effective Grammar-Based Compression Algorithm for Tree Structured Data. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ILP ![In: Inductive Logic Programming: 13th International Conference, ILP 2003, Szeged, Hungary, September 29-October 1, 2003, Proceedings, pp. 383-400, 2003, Springer, 3-540-20144-0. The full citation details ...](Pics/full.jpeg) |
2003 |
DBLP DOI BibTeX RDF |
|
54 | Kiyoko F. Aoki-Kinoshita, Minoru Kanehisa, Ming-Yang Kao, Xiang-Yang Li 0001, Weizhao Wang |
A 6-Approximation Algorithm for Computing Smallest Common AoN-Supertree with Application to the Reconstruction of Glycan Trees. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ISAAC ![In: Algorithms and Computation, 17th International Symposium, ISAAC 2006, Kolkata, India, December 18-20, 2006, Proceedings, pp. 100-110, 2006, Springer, 3-540-49694-7. The full citation details ...](Pics/full.jpeg) |
2006 |
DBLP DOI BibTeX RDF |
|
52 | Michael Mitzenmacher |
Constant Time per Edge is Optimal on Rooted Tree Networks. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Distributed Comput. ![In: Distributed Comput. 10(4), pp. 189-197, 1997. The full citation details ...](Pics/full.jpeg) |
1997 |
DBLP DOI BibTeX RDF |
Increasing convex ordering, Queueing theory, Tree networks, Stochastic comparisons |
51 | Mohamed Naimi |
Parallel assignment to distinct identities in arbitrary networks. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ICCCN ![In: Proceedings of the 4th International Conference on Computer Communications and Networks (ICCCN '95), September 20-23, 1995, Las Vegas, Nevada, USA, pp. 475, 1995, IEEE Computer Society, 0-8186-7180-7. The full citation details ...](Pics/full.jpeg) |
1995 |
DBLP DOI BibTeX RDF |
sequential distributed algorithm, parallel assignment, distinct identities, parallel distributed algorithm, distributed system nodes, initiator channel, children channel, outgoing channels, upper bound time transmission, parallel algorithms, multiprocessor interconnection networks, time complexity, communication complexity, spanning tree, depth-first search, network diameter, rooted tree, arbitrary network, synchronous distributed systems |
50 | Yusuke Suzuki, Ryuta Akanuma, Takayoshi Shoudai, Tetsuhiro Miyahara, Tomoyuki Uchida |
Polynomial Time Inductive Inference of Ordered Tree Patterns with Internal Structured Variables from Positive Data. ![Search on Bibsonomy](Pics/bibsonomy.png) |
COLT ![In: Computational Learning Theory, 15th Annual Conference on Computational Learning Theory, COLT 2002, Sydney, Australia, July 8-10, 2002, Proceedings, pp. 169-184, 2002, Springer, 3-540-43836-X. The full citation details ...](Pics/full.jpeg) |
2002 |
DBLP DOI BibTeX RDF |
|
50 | Koichi Yamazaki, Hans L. Bodlaender, Babette de Fluiter, Dimitrios M. Thilikos |
Isomorphism for Graphs of Bounded Distance Width. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Algorithmica ![In: Algorithmica 24(2), pp. 105-127, 1999. The full citation details ...](Pics/full.jpeg) |
1999 |
DBLP DOI BibTeX RDF |
Distance pathwidth, Distance treewidth, Graph isomorphism, Fixed parameter tractability |
50 | Koichi Yamazaki, Hans L. Bodlaender, Babette de Fluiter, Dimitrios M. Thilikos |
Isomorphism for Graphs of Bounded Distance Width. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CIAC ![In: Algorithms and Complexity, Third Italian Conference, CIAC '97, Rome, Italy, March 12-14, 1997, Proceedings, pp. 276-287, 1997, Springer, 3-540-62592-5. The full citation details ...](Pics/full.jpeg) |
1997 |
DBLP DOI BibTeX RDF |
|
48 | Zhicheng Dai, Zhi Li 0027, Bingwen Wang, Qiang Tang 0004 |
RTKPS: A Key Pre-distribution Scheme Based on Rooted-Tree in Wireless Sensor and Actor Network. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ISNN (3) ![In: Advances in Neural Networks - ISNN 2009, 6th International Symposium on Neural Networks, ISNN 2009, Wuhan, China, May 26-29, 2009, Proceedings, Part III, pp. 890-898, 2009, Springer, 978-3-642-01512-0. The full citation details ...](Pics/full.jpeg) |
2009 |
DBLP DOI BibTeX RDF |
WSAN, Key Ring, WSN, Key Pre-distribution, Rooted-Tree |
48 | Yusuke Suzuki, Kohtaro Inomae, Takayoshi Shoudai, Tetsuhiro Miyahara, Tomoyuki Uchida |
A Polynomial Time Matching Algorithm of Structured Ordered Tree Patterns for Data Mining from Semistructured Data. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ILP ![In: Inductive Logic Programming, 12th International Conference, ILP 2002, Sydney, Australia, July 9-11, 2002. Revised Papers, pp. 270-284, 2002, Springer, 3-540-00567-6. The full citation details ...](Pics/full.jpeg) |
2002 |
DBLP DOI BibTeX RDF |
|
42 | Konstantinos Mastakas |
Drawing a rooted tree as a rooted y-monotone minimum spanning tree. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Inf. Process. Lett. ![In: Inf. Process. Lett. 166, pp. 106035, 2021. The full citation details ...](Pics/full.jpeg) |
2021 |
DBLP DOI BibTeX RDF |
|
42 | Konstantinos Mastakas |
Drawing a Rooted Tree as a Rooted y-Monotone Minimum Spanning Tree. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CoRR ![In: CoRR abs/1806.04720, 2018. The full citation details ...](Pics/full.jpeg) |
2018 |
DBLP BibTeX RDF |
|
41 | Kazuhide Aikou, Yusuke Suzuki, Takayoshi Shoudai, Tomoyuki Uchida, Tetsuhiro Miyahara |
A Polynomial Time Matching Algorithm of Ordered Tree Patterns Having Height-Constrained Variables. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CPM ![In: Combinatorial Pattern Matching, 16th Annual Symposium, CPM 2005, Jeju Island, Korea, June 19-22, 2005, Proceedings, pp. 346-357, 2005, Springer, 3-540-26201-6. The full citation details ...](Pics/full.jpeg) |
2005 |
DBLP DOI BibTeX RDF |
|
40 | Ahmed Housni, Michel Tréhel |
Distributed Mutual Exclusion Token-Permission Based by Prioritized Groups. ![Search on Bibsonomy](Pics/bibsonomy.png) |
AICCSA ![In: 2001 ACS / IEEE International Conference on Computer Systems and Applications (AICCSA 2001), 26-29 June 2001, Beirut, Lebanon, pp. 253-259, 2001, IEEE Computer Society, 0-7695-1165-1. The full citation details ...](Pics/full.jpeg) |
2001 |
DBLP DOI BibTeX RDF |
Algorithm, Groups, Priority, Token, permission, Distributed Mutual Exclusion, Rooted tree |
40 | Yusuke Suzuki, Takayoshi Shoudai, Satoshi Matsumoto, Tomoyuki Uchida, Tetsuhiro Miyahara |
Efficient Learning of Ordered and Unordered Tree Patterns with Contractible Variables. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ALT ![In: Algorithmic Learning Theory, 14th International Conference, ALT 2003, Sapporo, Japan, October 17-19, 2003, Proceedings, pp. 114-128, 2003, Springer, 3-540-20291-9. The full citation details ...](Pics/full.jpeg) |
2003 |
DBLP DOI BibTeX RDF |
|
38 | Yusuke Suzuki, Takayoshi Shoudai, Satoshi Matsumoto, Tomoyuki Uchida |
Efficient Learning of Unlabeled Term Trees with Contractible Variables from Positive Data. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ILP ![In: Inductive Logic Programming: 13th International Conference, ILP 2003, Szeged, Hungary, September 29-October 1, 2003, Proceedings, pp. 347-364, 2003, Springer, 3-540-20144-0. The full citation details ...](Pics/full.jpeg) |
2003 |
DBLP DOI BibTeX RDF |
|
36 | Yun Chi, Yirong Yang, Richard R. Muntz |
HybridTreeMiner: An Efficient Algorithm for Mining Frequent Rooted Trees and Free Trees Using Canonical Form. ![Search on Bibsonomy](Pics/bibsonomy.png) |
SSDBM ![In: Proceedings of the 16th International Conference on Scientific and Statistical Database Management (SSDBM 2004), 21-23 June 2004, Santorini Island, Greece, pp. 11-20, 2004, IEEE Computer Society, 0-7695-2146-0. The full citation details ...](Pics/full.jpeg) |
2004 |
DBLP DOI BibTeX RDF |
tree iso-morphism, enumeration tree, rooted unordered tree, free tree, canonical form, frequent subtree |
34 | Lih-Hsing Hsu, Jones J. J. Wang |
Undordered Tree Contraction. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ICCI ![In: Advances in Computing and Information - ICCI'91, International Conference on Computing and Information, Ottawa, Canada, May 27-29, 1991, Proceedings, pp. 347-349, 1991, Springer, 3-540-54029-6. The full citation details ...](Pics/full.jpeg) |
1991 |
DBLP DOI BibTeX RDF |
|
32 | Yusuke Suzuki, Takayoshi Shoudai, Tomoyuki Uchida, Tetsuhiro Miyahara |
Ordered Term Tree Languages which Are Polynomial Time Inductively Inferable from Positive Data. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ALT ![In: Algorithmic Learning Theory, 13th International Conference, ALT 2002, Lübeck, Germany, November 24-26, 2002, Proceedings, pp. 188-202, 2002, Springer, 3-540-00170-0. The full citation details ...](Pics/full.jpeg) |
2002 |
DBLP DOI BibTeX RDF |
|
31 | Yusuke Suzuki, Takayoshi Shoudai, Satoshi Matsumoto, Tetsuhiro Miyahara |
Polynomial Time Inductive Inference of Ordered Tree Languages with Height-Constrained Variables from Positive Data. ![Search on Bibsonomy](Pics/bibsonomy.png) |
PRICAI ![In: PRICAI 2004: Trends in Artificial Intelligence, 8th Pacific Rim International Conference on Artificial Intelligence, Auckland, New Zealand, August 9-13, 2004, Proceedings, pp. 211-220, 2004, Springer, 3-540-22817-9. The full citation details ...](Pics/full.jpeg) |
2004 |
DBLP DOI BibTeX RDF |
|
28 | H. A. Donegan, G. E. Livesey, T. B. M. McMaster, G. J. McAleavy |
Axiomatic considerations of a rule based mechanism for the determination of a building's egress capability. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Artif. Intell. Rev. ![In: Artif. Intell. Rev. 27(1), pp. 5-19, 2007. The full citation details ...](Pics/full.jpeg) |
2007 |
DBLP DOI BibTeX RDF |
Building evacuation, Egress complexity, Entropy, Floorplan, Rooted tree |
28 | Ander Murua |
The Hopf Algebra of Rooted Trees, Free Lie Algebras, and Lie Series. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Found. Comput. Math. ![In: Found. Comput. Math. 6(4), pp. 387-426, 2006. The full citation details ...](Pics/full.jpeg) |
2006 |
DBLP DOI BibTeX RDF |
Free Lie algebra, Continous BCH function, Hopf algbra of rooted trees, Hall rooted trees, Lie series, Dual PBW basis, Rewritting algorithm, Logarithm of Chenn-Fliess series, Series of vector fields, Rooted tree |
28 | Doowon Paik, Sudhakar M. Reddy, Sartaj Sahni |
Deleting Vertices to Bound Path Length. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IEEE Trans. Computers ![In: IEEE Trans. Computers 43(9), pp. 1091-1096, 1994. The full citation details ...](Pics/full.jpeg) |
1994 |
DBLP DOI BibTeX RDF |
vertex deletion problem, path length bound, weighted directed acyclic graphs, quadratic time, computational complexity, directed graphs, NP-hard problems, linear time, series-parallel graph, rooted tree |
28 | Jean-Michel Hélary, Achour Mostéfaoui, Michel Raynal |
A General Scheme for Token- and Tree-Based Distributed Mutual Exclusion Algorithms. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IEEE Trans. Parallel Distributed Syst. ![In: IEEE Trans. Parallel Distributed Syst. 5(11), pp. 1185-1196, 1994. The full citation details ...](Pics/full.jpeg) |
1994 |
DBLP DOI BibTeX RDF |
token-based distributed mutualexclusion algorithms, tree-based distributed mutual exclusion algorithms, permission-based mutual exclusion algorithms, rooted tree structure, informationstructure, topology requirements, distributed algorithms, distributed algorithms, topology, tree data structures, generic algorithm |
28 | K. Vidyasankar |
A Non-Two Phase Locking Protocol for Global Concurrency Control in Distributed Heterogeneous Database Systems. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IEEE Trans. Knowl. Data Eng. ![In: IEEE Trans. Knowl. Data Eng. 3(2), pp. 256-261, 1991. The full citation details ...](Pics/full.jpeg) |
1991 |
DBLP DOI BibTeX RDF |
non-two-phase locking protocol, global concurrency control, distributed heterogeneous database systems, global transactions, database sites, rooted tree fashion, global transaction manager, GTM, g-local transactions, concurrency control mechanism, local transactions, g-local transactions, protocols, distributed databases, concurrency control, transaction processing, system recovery, serializability, deadlock freedom, general architecture |
27 | Borislav V. Minchev |
Integrating Factor Methods as Exponential Integrators. ![Search on Bibsonomy](Pics/bibsonomy.png) |
LSSC ![In: Large-Scale Scientific Computing, 5th International Conference, LSSC 2005, Sozopol, Bulgaria, June 6-10, 2005, Revised Papers, pp. 380-386, 2005, Springer, 3-540-31994-8. The full citation details ...](Pics/full.jpeg) |
2005 |
DBLP DOI BibTeX RDF |
|
26 | Satoshi Matsumoto, Takayoshi Shoudai, Tetsuhiro Miyahara, Tomoyuki Uchida |
Learning of Finite Unions of Tree Patterns with Internal Structured Variables from Queries. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Australian Joint Conference on Artificial Intelligence ![In: AI 2002: Advances in Artificial Intelligence, 15th Australian Joint Conference on Artificial Intelligence, Canberra, Australia, December 2-6, 2002, Proceedings, pp. 523-534, 2002, Springer, 3-540-00197-2. The full citation details ...](Pics/full.jpeg) |
2002 |
DBLP DOI BibTeX RDF |
|
26 | Sylvain Béal, Eric Rémila, Philippe Solal |
Rooted-tree solutions for tree games. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Eur. J. Oper. Res. ![In: Eur. J. Oper. Res. 203(2), pp. 404-408, 2010. The full citation details ...](Pics/full.jpeg) |
2010 |
DBLP DOI BibTeX RDF |
|
26 | Hiroshi Nagamochi, Kohei Okada |
Approximating the minmax rooted-tree cover in a tree. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Inf. Process. Lett. ![In: Inf. Process. Lett. 104(5), pp. 173-178, 2007. The full citation details ...](Pics/full.jpeg) |
2007 |
DBLP DOI BibTeX RDF |
|
25 | Kazuyoshi Furukawa, Tomoyuki Uchida, Kazuya Yamada, Tetsuhiro Miyahara, Takayoshi Shoudai, Yasuaki Nakamura |
Extracting Characteristic Structures among Words in Semistructured Documents. ![Search on Bibsonomy](Pics/bibsonomy.png) |
PAKDD ![In: Advances in Knowledge Discovery and Data Mining, 6th Pacific-Asia Conference, PAKDD 2002, Taipei, Taiwan, May 6-8, 2002, Proceedings, pp. 356-367, 2002, Springer, 3-540-43704-5. The full citation details ...](Pics/full.jpeg) |
2002 |
DBLP DOI BibTeX RDF |
|
23 | Norman Y. Foo, Pavlos Peppas, Yan Zhang 0003 |
Inductive Properties of States. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Australian Joint Conference on Artificial Intelligence ![In: Advanced Topics in Artificial Intelligence, 10th Australian Joint Conference on Artificial Intelligence, AI '97, Perth, Australia, November 30 - December 4, 1997, Proceedings, pp. 227-235, 1997, Springer, 3-540-63797-4. The full citation details ...](Pics/full.jpeg) |
1997 |
DBLP DOI BibTeX RDF |
induction, actions, states, automaton, situation calculus |
22 | Satoshi Matsumoto, Yusuke Suzuki, Takayoshi Shoudai, Tetsuhiro Miyahara, Tomoyuki Uchida |
Learning of Finite Unions of Tree Patterns with Repeated Internal Structured Variables from Queries. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ALT ![In: Algorithmic Learning Theory, 14th International Conference, ALT 2003, Sapporo, Japan, October 17-19, 2003, Proceedings, pp. 144-158, 2003, Springer, 3-540-20291-9. The full citation details ...](Pics/full.jpeg) |
2003 |
DBLP DOI BibTeX RDF |
|
22 | Jean R. S. Blair, Fredrik Manne |
Efficient Self-stabilizing Algorithms for Tree Network. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ICDCS ![In: 23rd International Conference on Distributed Computing Systems (ICDCS 2003), 19-22 May 2003, Providence, RI, USA, pp. 20-, 2003, IEEE Computer Society, 0-7695-1920-2. The full citation details ...](Pics/full.jpeg) |
2003 |
DBLP DOI BibTeX RDF |
|
22 | Stephen Alstrup, Cyril Gavoille, Haim Kaplan, Theis Rauhe |
Nearest common ancestors: a survey and a new distributed algorithm. ![Search on Bibsonomy](Pics/bibsonomy.png) |
SPAA ![In: Proceedings of the Fourteenth Annual ACM Symposium on Parallel Algorithms and Architectures, SPAA 2002, Winnipeg, Manitoba, Canada, August 11-13, 2002, pp. 258-264, 2002, ACM, 1-58113-529-7. The full citation details ...](Pics/full.jpeg) |
2002 |
DBLP DOI BibTeX RDF |
ancestor, distributed, labeling |
22 | Michel Tréhel, Ahmed Housni |
The Prioritized and Distributed Synchronization in Distributed Groups. ![Search on Bibsonomy](Pics/bibsonomy.png) |
International Conference on Computational Science (1) ![In: Computational Science - ICCS 2001, International Conference, San Francisco, CA, USA, May 28-30, 2001. Proceedings, Part I, pp. 294-306, 2001, Springer, 3-540-42232-3. The full citation details ...](Pics/full.jpeg) |
2001 |
DBLP DOI BibTeX RDF |
|
22 | Yoshiyuki Karuno, Hiroshi Nagamochi, Toshihide Ibaraki |
Vehicle Scheduling on a Tree with Release and Handling Times. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ISAAC ![In: Algorithms and Computation, 4th International Symposium, ISAAC '93, Hong Kong, December 15-17, 1993, Proceedings, pp. 486-495, 1993, Springer, 3-540-57568-5. The full citation details ...](Pics/full.jpeg) |
1993 |
DBLP DOI BibTeX RDF |
|
21 | Dong Hua, Dechang Chen, Xiuzhen Cheng 0001, Abdou Youssef |
Latent Structure Models for the Analysis of Gene Expression Data. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CSB ![In: 2nd IEEE Computer Society Bioinformatics Conference, CSB 2003, Stanford, CA, USA, August 11-14, 2003, pp. 496-499, 2003, IEEE Computer Society, 0-7695-2000-6. The full citation details ...](Pics/full.jpeg) |
2003 |
DBLP DOI BibTeX RDF |
|
21 | Rong Lin, Stephan Olariu |
A Simple Optimal Parallel Algorithm to Solve the Lowest Common Ancestor Problem. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ICCI ![In: Advances in Computing and Information - ICCI'91, International Conference on Computing and Information, Ottawa, Canada, May 27-29, 1991, Proceedings, pp. 455-461, 1991, Springer, 3-540-54029-6. The full citation details ...](Pics/full.jpeg) |
1991 |
DBLP DOI BibTeX RDF |
parallel algorithms, EREW-PRAM, list ranking, lowest common ancestors, ordered trees, Euler tour |
21 | Paraschos Koutris, Xiating Ouyang, Jef Wijsen |
Consistent Query Answering for Primary Keys on Rooted Tree Queries. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CoRR ![In: CoRR abs/2310.19642, 2023. The full citation details ...](Pics/full.jpeg) |
2023 |
DBLP DOI BibTeX RDF |
|
21 | Pengxiang Pan, Junran Lichen, Ping Yang, Jianping Li |
The Heterogeneous Rooted Tree Cover Problem. ![Search on Bibsonomy](Pics/bibsonomy.png) |
COCOON (2) ![In: Computing and Combinatorics - 29th International Conference, COCOON 2023, Hawaii, HI, USA, December 15-17, 2023, Proceedings, Part II, pp. 94-105, 2023, Springer, 978-3-031-49192-4. The full citation details ...](Pics/full.jpeg) |
2023 |
DBLP DOI BibTeX RDF |
|
21 | Hervé L. M. Kerivin, Jinhua Zhao |
Bounded-degree rooted tree and TDI-ness. ![Search on Bibsonomy](Pics/bibsonomy.png) |
RAIRO Oper. Res. ![In: RAIRO Oper. Res. 56(4), pp. 2181-2201, 2022. The full citation details ...](Pics/full.jpeg) |
2022 |
DBLP DOI BibTeX RDF |
|
21 | Hervé Kerivin, Jinhua Zhao |
A computational study on the Maximum-Weight Bounded-Degree Rooted Tree Problem. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Appl. Math. Comput. ![In: Appl. Math. Comput. 413, pp. 126623, 2022. The full citation details ...](Pics/full.jpeg) |
2022 |
DBLP DOI BibTeX RDF |
|
21 | Adel Aghajan, Behrouz Touri |
Ergodicity of Continuous-Time Distributed Averaging Dynamics: A Spanning Directed Rooted Tree Approach. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IEEE Trans. Autom. Control. ![In: IEEE Trans. Autom. Control. 67(2), pp. 918-925, 2022. The full citation details ...](Pics/full.jpeg) |
2022 |
DBLP DOI BibTeX RDF |
|
21 | Badre Bossoufi, Mohammed Karim, Mohammed Taoussi, Hala Alami Aroussi, Manale Bouderbala, Olivier Deblecker, Saad Motahhir, Anand Nayyar, Mohammed A. Alzain |
Rooted Tree Optimization for the Backstepping Power Control of a Doubly Fed Induction Generator Wind Turbine: dSPACE Implementation. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IEEE Access ![In: IEEE Access 9, pp. 26512-26522, 2021. The full citation details ...](Pics/full.jpeg) |
2021 |
DBLP DOI BibTeX RDF |
|
21 | Abdul Wadood, Tahir Khurshaid, Saeid Gholami Farkoush, Chang-Hwan Kim, Sang-Bong Rhee |
A Bio-Inspired Rooted Tree Algorithm for Optimal Coordination of Overcurrent Relays. ![Search on Bibsonomy](Pics/bibsonomy.png) |
INTAP ![In: Intelligent Technologies and Applications - First International Conference, INTAP 2018, Bahawalpur, Pakistan, October 23-25, 2018, Revised Selected Papers, pp. 188-201, 2018, Springer, 978-981-13-6051-0. The full citation details ...](Pics/full.jpeg) |
2018 |
DBLP DOI BibTeX RDF |
|
21 | Xianyang Zeng, Hongli Yang, Xinyuan Wu |
An improved tri-coloured rooted-tree theory and order conditions for ERKN methods for general multi-frequency oscillatory systems. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Numer. Algorithms ![In: Numer. Algorithms 75(4), pp. 909-935, 2017. The full citation details ...](Pics/full.jpeg) |
2017 |
DBLP DOI BibTeX RDF |
|
21 | Nilesh Vyas, Debashis Saha, Prasanta K. Panigrahi |
Rooted-tree network for optimal non-local gate implementation. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Quantum Inf. Process. ![In: Quantum Inf. Process. 15(9), pp. 3855-3867, 2016. The full citation details ...](Pics/full.jpeg) |
2016 |
DBLP DOI BibTeX RDF |
|
21 | Laurent Galluccio, Olivier J. J. Michel, Pierre Comon, Mark Kliger, Alfred O. Hero III |
Clustering with a new distance measure based on a dual-rooted tree. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Inf. Sci. ![In: Inf. Sci. 251, pp. 96-113, 2013. The full citation details ...](Pics/full.jpeg) |
2013 |
DBLP DOI BibTeX RDF |
|
21 | Naoki Katoh, Shin-ichi Tanigawa |
Rooted-Tree Decompositions with Matroid Constraints and the Infinitesimal Rigidity of Frameworks with Boundaries. ![Search on Bibsonomy](Pics/bibsonomy.png) |
SIAM J. Discret. Math. ![In: SIAM J. Discret. Math. 27(1), pp. 155-185, 2013. The full citation details ...](Pics/full.jpeg) |
2013 |
DBLP DOI BibTeX RDF |
|
21 | Hans-Jörg Schulz, Zabedul Akbar, Frank Maurer |
A generative layout approach for rooted tree drawings. ![Search on Bibsonomy](Pics/bibsonomy.png) |
PacificVis ![In: IEEE Pacific Visualization Symposium, PacificVis 2013, February 27 2013-March 1, 2013, Sydney, NSW, Australia, pp. 225-232, 2013, IEEE Computer Society. The full citation details ...](Pics/full.jpeg) |
2013 |
DBLP DOI BibTeX RDF |
|
21 | Emeric Deutsch |
Rooted tree statistics from Matula numbers. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Discret. Appl. Math. ![In: Discret. Appl. Math. 160(15), pp. 2314-2322, 2012. The full citation details ...](Pics/full.jpeg) |
2012 |
DBLP DOI BibTeX RDF |
|
21 | Hervé Kerivin, Jimmy Leblet, Gwendal Simon, Fen Zhou 0001 |
Maximum Bounded Rooted-Tree Packing Problem ![Search on Bibsonomy](Pics/bibsonomy.png) |
CoRR ![In: CoRR abs/1111.0706, 2011. The full citation details ...](Pics/full.jpeg) |
2011 |
DBLP BibTeX RDF |
|
21 | Naoki Katoh, Shin-ichi Tanigawa |
Rooted-tree Decompositions with Matroid Constraints and the Infinitesimal Rigidity of Frameworks with Boundaries ![Search on Bibsonomy](Pics/bibsonomy.png) |
CoRR ![In: CoRR abs/1109.0787, 2011. The full citation details ...](Pics/full.jpeg) |
2011 |
DBLP BibTeX RDF |
|
21 | Mykhaylo Tyomkyn |
A proof of the rooted tree alternative conjecture. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Discret. Math. ![In: Discret. Math. 309(20), pp. 5963-5967, 2009. The full citation details ...](Pics/full.jpeg) |
2009 |
DBLP DOI BibTeX RDF |
|
21 | Stephan G. Wagner |
On an Identity for the Cycle Indices of Rooted Tree Automorphism Groups. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Electron. J. Comb. ![In: Electron. J. Comb. 13(1), 2006. The full citation details ...](Pics/full.jpeg) |
2006 |
DBLP DOI BibTeX RDF |
|
21 | José Luis Ruiz, Mercè Mora |
De Bruijn and Kautz digraphs of a rooted tree. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Discret. Math. ![In: Discret. Math. 293(1-3), pp. 219-236, 2005. The full citation details ...](Pics/full.jpeg) |
2005 |
DBLP DOI BibTeX RDF |
|
21 | Laurent Bartholdi |
Lower Bounds on The Growth of a Group Acting on the Binary Rooted Tree. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Int. J. Algebra Comput. ![In: Int. J. Algebra Comput. 11(1), pp. 73-88, 2001. The full citation details ...](Pics/full.jpeg) |
2001 |
DBLP DOI BibTeX RDF |
|
21 | Radha Poovendran, John S. Baras |
An information-theoretic approach for design and analysis of rooted-tree-based multicast key management schemes. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IEEE Trans. Inf. Theory ![In: IEEE Trans. Inf. Theory 47(7), pp. 2824-2834, 2001. The full citation details ...](Pics/full.jpeg) |
2001 |
DBLP DOI BibTeX RDF |
|
21 | Franck Petit, Vincent Villain |
Optimality and Self-Stabilization in Rooted Tree Networks. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Parallel Process. Lett. ![In: Parallel Process. Lett. 10(1), pp. 3-14, 2000. The full citation details ...](Pics/full.jpeg) |
2000 |
DBLP DOI BibTeX RDF |
|
21 | Rossen Stefanov |
Interval representation of a rooted tree with an order of the immediate children. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CompSysTech ![In: Proceedings of the Conference on Computer Systems and Technologies, CompSysTech 2000, Sofia, Bulgaria, 2000, pp. 2111-2115, 2000, ACM, 978-954-9641-17-2. The full citation details ...](Pics/full.jpeg) |
2000 |
DBLP DOI BibTeX RDF |
|
21 | Franck Petit, Vincent Villain |
Optimality and Self-Stabilization in Rooted Tree Networks. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Parallel Process. Lett. ![In: Parallel Process. Lett. 9(3), pp. 313-323, 1999. The full citation details ...](Pics/full.jpeg) |
1999 |
DBLP DOI BibTeX RDF |
|
21 | Radha Poovendran, John S. Baras |
An Information Theoretic Analysis of Rooted-Tree Based Secure Multicast Key Distribution Schemes. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CRYPTO ![In: Advances in Cryptology - CRYPTO '99, 19th Annual International Cryptology Conference, Santa Barbara, California, USA, August 15-19, 1999, Proceedings, pp. 624-638, 1999, Springer, 3-540-66347-9. The full citation details ...](Pics/full.jpeg) |
1999 |
DBLP DOI BibTeX RDF |
|
21 | Michael Mitzenmacher |
Constant Time per Edge is Optimal on Rooted Tree Networks. ![Search on Bibsonomy](Pics/bibsonomy.png) |
SPAA ![In: Proceedings of the 8th Annual ACM Symposium on Parallel Algorithms and Architectures, SPAA '96, Padua, Italy, June 24-26, 1996, pp. 162-169, 1996, ACM, 0-89791-809-6. The full citation details ...](Pics/full.jpeg) |
1996 |
DBLP DOI BibTeX RDF |
|
21 | Yoshiko Ikebe, Micha A. Perles, Akihisa Tamura, Shinnichi Tokunaga |
The Rooted Tree Embedding Problem into Points in the Plane. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Discret. Comput. Geom. ![In: Discret. Comput. Geom. 11, pp. 51-63, 1994. The full citation details ...](Pics/full.jpeg) |
1994 |
DBLP DOI BibTeX RDF |
|
21 | Paul N. Hilfinger, Eugene L. Lawler, Günter Rote |
Flattening a Rooted Tree. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Applied Geometry And Discrete Mathematics ![In: Applied Geometry And Discrete Mathematics, Proceedings of a DIMACS Workshop, Providence, Rhode Island, USA, September 18, 1990, pp. 335-340, 1990, DIMACS/AMS, 978-0-8218-6593-4. The full citation details ...](Pics/full.jpeg) |
1990 |
DBLP DOI BibTeX RDF |
|
21 | Jayme Luiz Szwarcfiter |
On digraphs with a rooted tree structure. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Networks ![In: Networks 15(1), pp. 49-57, 1985. The full citation details ...](Pics/full.jpeg) |
1985 |
DBLP DOI BibTeX RDF |
|
20 | Ian P. Gent, Patrick Prosser, Barbara M. Smith, Wu Wei |
Supertree Construction with Constraint Programming. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CP ![In: Principles and Practice of Constraint Programming - CP 2003, 9th International Conference, CP 2003, Kinsale, Ireland, September 29 - October 3, 2003, Proceedings, pp. 837-841, 2003, Springer, 3-540-20202-1. The full citation details ...](Pics/full.jpeg) |
2003 |
DBLP DOI BibTeX RDF |
|
20 | Alexander Zelikovsky, Ion I. Mandoiu |
Practical approximation algorithms for zero- and bounded-skew trees. ![Search on Bibsonomy](Pics/bibsonomy.png) |
SODA ![In: Proceedings of the Twelfth Annual Symposium on Discrete Algorithms, January 7-9, 2001, Washington, DC, USA., pp. 407-416, 2001, ACM/SIAM, 0-89871-490-7. The full citation details ...](Pics/full.jpeg) |
2001 |
DBLP BibTeX RDF |
|
19 | Tatsuya Akutsu, Daiji Fukagawa, Atsuhiro Takasu |
Approximating Tree Edit Distance Through String Edit Distance. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ISAAC ![In: Algorithms and Computation, 17th International Symposium, ISAAC 2006, Kolkata, India, December 18-20, 2006, Proceedings, pp. 90-99, 2006, Springer, 3-540-49694-7. The full citation details ...](Pics/full.jpeg) |
2006 |
DBLP DOI BibTeX RDF |
|
17 | James Allen Fill, Nevin Kapur, Alois Panholzer |
Destruction of Very Simple Trees. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Algorithmica ![In: Algorithmica 46(3-4), pp. 345-366, 2006. The full citation details ...](Pics/full.jpeg) |
2006 |
DBLP DOI BibTeX RDF |
|
17 | Irene Finocchi, Rossella Petreschi |
Structure-Preserving Hierarchical Decompositions. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Theory Comput. Syst. ![In: Theory Comput. Syst. 38(6), pp. 687-700, 2005. The full citation details ...](Pics/full.jpeg) |
2005 |
DBLP DOI BibTeX RDF |
|
17 | Ole Fogh Olsen |
Tree Edit Distances from Singularity Theory. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Scale-Space ![In: Scale Space and PDE Methods in Computer Vision, 5th International Conference, Scale-Space 2005, Hofgeismar, Germany, April 7-9, 2005, Proceedings, pp. 316-326, 2005, Springer, 3-540-25547-8. The full citation details ...](Pics/full.jpeg) |
2005 |
DBLP DOI BibTeX RDF |
|
17 | Walter G. Kropatsch, Yll Haxhimusa, Zygmunt Pizlo |
Integral Trees: Subtree Depth and Diameter. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IWCIA ![In: Combinatorial Image Analysis, 10th InternationalWorkshop, IWCIA 2004, Auckland, New Zealand, December 1-3, 2004, Proceedings, pp. 77-87, 2004, Springer, 3-540-23942-1. The full citation details ...](Pics/full.jpeg) |
2004 |
DBLP DOI BibTeX RDF |
|
17 | Alain Bui, Ajoy Kumar Datta, Franck Petit, Vincent Villain |
Space optimal PIF algorithm: self-stabilized with no extra space. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IPCCC ![In: Proceedings of the IEEE International Performance Computing and Communications Conference, IPCCC 1999, Phoenix/Scottsdale, Arizona, USA, 10-12 February 1999, pp. 20-26, 1999, IEEE, 0-7803-5258-0. The full citation details ...](Pics/full.jpeg) |
1999 |
DBLP DOI BibTeX RDF |
|
17 | Alan Roberts, Antonios Symvonis |
On-Line Matching Routing on Trees. ![Search on Bibsonomy](Pics/bibsonomy.png) |
LATIN ![In: LATIN '98: Theoretical Informatics, Third Latin American Symposium, Campinas, Brazil, April, 20-24, 1998, Proceedings, pp. 282-291, 1998, Springer, 3-540-64275-7. The full citation details ...](Pics/full.jpeg) |
1998 |
DBLP DOI BibTeX RDF |
|
15 | Hao Yuan, Mikhail J. Atallah |
Efficient data structures for range-aggregate queries on trees. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ICDT ![In: Database Theory - ICDT 2009, 12th International Conference, St. Petersburg, Russia, March 23-25, 2009, Proceedings, pp. 111-120, 2009, ACM, 978-1-60558-423-2. The full citation details ...](Pics/full.jpeg) |
2009 |
DBLP DOI BibTeX RDF |
range aggregation, query answering |
15 | Hsueh-I Lu, Chia-Chi Yeh |
Balanced parentheses strike back. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ACM Trans. Algorithms ![In: ACM Trans. Algorithms 4(3), pp. 28:1-28:13, 2008. The full citation details ...](Pics/full.jpeg) |
2008 |
DBLP DOI BibTeX RDF |
XML document representation, Succinct data structures |
15 | Paul S. Bonsma, Frederic Dorn |
Tight Bounds and a Fast FPT Algorithm for Directed Max-Leaf Spanning Tree. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ESA ![In: Algorithms - ESA 2008, 16th Annual European Symposium, Karlsruhe, Germany, September 15-17, 2008. Proceedings, pp. 222-233, 2008, Springer, 978-3-540-87743-1. The full citation details ...](Pics/full.jpeg) |
2008 |
DBLP DOI BibTeX RDF |
|
15 | Doina Bein, Ajoy Kumar Datta, Lawrence L. Larmore |
Self-stabilizing algorithms for sorting and heapification. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IPDPS ![In: 22nd IEEE International Symposium on Parallel and Distributed Processing, IPDPS 2008, Miami, Florida USA, April 14-18, 2008, pp. 1-12, 2008, IEEE. The full citation details ...](Pics/full.jpeg) |
2008 |
DBLP DOI BibTeX RDF |
|
15 | Venkatraman Ramakrishna, Max Robinson, Kevin Eustice, Peter L. Reiher |
An Active Self-Optimizing Multiplayer Gaming Architecture. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Clust. Comput. ![In: Clust. Comput. 9(2), pp. 201-215, 2006. The full citation details ...](Pics/full.jpeg) |
2006 |
DBLP DOI BibTeX RDF |
Self-optimizing middleware, Packet aggregation, Multicast, Active networks, Multiplayer games |
15 | Guido Proietti, Peter Widmayer |
A truthful mechanism for the non-utilitarian minimum radius spanning tree problem. ![Search on Bibsonomy](Pics/bibsonomy.png) |
SPAA ![In: SPAA 2005: Proceedings of the 17th Annual ACM Symposium on Parallelism in Algorithms and Architectures, July 18-20, 2005, Las Vegas, Nevada, USA, pp. 195-202, 2005, ACM, 1-58113-986-1. The full citation details ...](Pics/full.jpeg) |
2005 |
DBLP DOI BibTeX RDF |
pricing and equilibria in networks, algorithmic mechanism design, selfish agents, truthful mechanisms |
15 | Grzegorz Kubicki, Jenö Lehel, Michal Morayne |
An Asymptotic Ratio in the Complete Binary Tree. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Order ![In: Order 20(2), pp. 91-97, 2003. The full citation details ...](Pics/full.jpeg) |
2003 |
DBLP DOI BibTeX RDF |
tree poset, embedding, enumeration |
15 | Yaw-Ling Lin, Tsan-sheng Hsu |
Efficient Algorithms for Descendent Subtrees Comparison of Phylogenetic Trees with Applications to Co-evolutionary Classifications in Bacterial Genome. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ISAAC ![In: Algorithms and Computation, 14th International Symposium, ISAAC 2003, Kyoto, Japan, December 15-17, 2003, Proceedings, pp. 339-351, 2003, Springer, 3-540-20695-7. The full citation details ...](Pics/full.jpeg) |
2003 |
DBLP DOI BibTeX RDF |
|
15 | Evangelos Kranakis, Danny Krizanc, Sunil M. Shende |
Approximate Hotlink Assignment. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ISAAC ![In: Algorithms and Computation, 12th International Symposium, ISAAC 2001, Christchurch, New Zealand, December 19-21, 2001, Proceedings, pp. 756-767, 2001, Springer, 3-540-42985-9. The full citation details ...](Pics/full.jpeg) |
2001 |
DBLP DOI BibTeX RDF |
|
15 | Serge Abiteboul, Haim Kaplan, Tova Milo |
Compact labeling schemes for ancestor queries. ![Search on Bibsonomy](Pics/bibsonomy.png) |
SODA ![In: Proceedings of the Twelfth Annual Symposium on Discrete Algorithms, January 7-9, 2001, Washington, DC, USA., pp. 547-556, 2001, ACM/SIAM, 0-89871-490-7. The full citation details ...](Pics/full.jpeg) |
2001 |
DBLP BibTeX RDF |
|
15 | Stephen Alstrup, Jacob Holm |
Improved Algorithms for Finding Level Ancestors in Dynamic Trees. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ICALP ![In: Automata, Languages and Programming, 27th International Colloquium, ICALP 2000, Geneva, Switzerland, July 9-15, 2000, Proceedings, pp. 73-84, 2000, Springer, 3-540-67715-1. The full citation details ...](Pics/full.jpeg) |
2000 |
DBLP DOI BibTeX RDF |
|
15 | Ming-Yang Kao |
Tree Contractions and Evolutionary Trees. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CIAC ![In: Algorithms and Complexity, Third Italian Conference, CIAC '97, Rome, Italy, March 12-14, 1997, Proceedings, pp. 299-310, 1997, Springer, 3-540-62592-5. The full citation details ...](Pics/full.jpeg) |
1997 |
DBLP DOI BibTeX RDF |
|
15 | François Bergeron, Philippe Flajolet, Bruno Salvy |
Varieties of Increasing Trees. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CAAP ![In: CAAP '92, 17th Colloquium on Trees in Algebra and Programming, Rennes, France, February 26-28, 1992, Proceedings, pp. 24-48, 1992, Springer, 3-540-55251-0. The full citation details ...](Pics/full.jpeg) |
1992 |
DBLP DOI BibTeX RDF |
|
13 | Stanislav Angelov, Sanjeev Khanna, Keshav Kunal |
The Network as a Storage Device: Dynamic Routing with Bounded Buffers. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Algorithmica ![In: Algorithmica 55(1), pp. 71-94, 2009. The full citation details ...](Pics/full.jpeg) |
2009 |
DBLP DOI BibTeX RDF |
Troughput maximization, Online algorithms, Network routing |
13 | Karim Douïeb, Stefan Langerman |
Dynamic Hotlinks. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Algorithmica ![In: Algorithmica 50(2), pp. 208-222, 2008. The full citation details ...](Pics/full.jpeg) |
2008 |
DBLP DOI BibTeX RDF |
Hotlink assignment, Jumplist, Amortization |
13 | Akram Shehadi Saynez, María Josefa Somodevilla García, Manuel Martín Ortiz, Ivo Humberto Pineda Torres |
H-Tree: A data structure for fast path-retrieval in rooted trees. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ENC ![In: Eight Mexican International Conference in Current Trends in Computer Science, ENC 2007, 24-28 September 2007, Morelia, Michoacan, Mexico, Proceedings, pp. 25-32, 2007, IEEE Computer Society, 0-7695-2899-6. The full citation details ...](Pics/full.jpeg) |
2007 |
DBLP DOI BibTeX RDF |
|
13 | Karim Douïeb, Stefan Langerman |
Near-Entropy Hotlink Assignments. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ESA ![In: Algorithms - ESA 2006, 14th Annual European Symposium, Zurich, Switzerland, September 11-13, 2006, Proceedings, pp. 292-303, 2006, Springer, 3-540-38875-3. The full citation details ...](Pics/full.jpeg) |
2006 |
DBLP DOI BibTeX RDF |
|
13 | Josiah Carlson, David Eppstein |
The Weighted Maximum-Mean Subtree and Other Bicriterion Subtree Problems. ![Search on Bibsonomy](Pics/bibsonomy.png) |
SWAT ![In: Algorithm Theory - SWAT 2006, 10th ScandinavianWorkshop on Algorithm Theory, Riga, Latvia, July 6-8, 2006, Proceedings, pp. 400-410, 2006, Springer, 3-540-35753-X. The full citation details ...](Pics/full.jpeg) |
2006 |
DBLP DOI BibTeX RDF |
|
13 | Zeshan Peng |
Algorithms for Local Forest Similarity. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ISAAC ![In: Algorithms and Computation, 16th International Symposium, ISAAC 2005, Sanya, Hainan, China, December 19-21, 2005, Proceedings, pp. 704-713, 2005, Springer, 3-540-30935-7. The full citation details ...](Pics/full.jpeg) |
2005 |
DBLP DOI BibTeX RDF |
|
13 | Karim Douïeb, Stefan Langerman |
Dynamic Hotlinks. ![Search on Bibsonomy](Pics/bibsonomy.png) |
WADS ![In: Algorithms and Data Structures, 9th International Workshop, WADS 2005, Waterloo, Canada, August 15-17, 2005, Proceedings, pp. 182-194, 2005, Springer, 3-540-28101-0. The full citation details ...](Pics/full.jpeg) |
2005 |
DBLP DOI BibTeX RDF |
|
13 | Arjan Kuijper |
Exploiting Deep Structure. ![Search on Bibsonomy](Pics/bibsonomy.png) |
DSSCV ![In: Deep Structure, Singularities, and Computer Vision, First International Workshop, DSSCV 2005, Maastricht, The Netherlands, June 9-10, 2005, Revised Selected Papers, pp. 169-180, 2005, Springer, 3-540-29836-3. The full citation details ...](Pics/full.jpeg) |
2005 |
DBLP DOI BibTeX RDF |
|
13 | Stanislav Angelov, Sanjeev Khanna, Keshav Kunal |
The Network as a Storage Device: Dynamic Routing with Bounded Buffers. ![Search on Bibsonomy](Pics/bibsonomy.png) |
APPROX-RANDOM ![In: Approximation, Randomization and Combinatorial Optimization, Algorithms and Techniques, 8th International Workshop on Approximation Algorithms for Combinatorial Optimization Problems, APPROX 2005 and 9th InternationalWorkshop on Randomization and Computation, RANDOM 2005, Berkeley, CA, USA, August 22-24, 2005, Proceedings, pp. 1-13, 2005, Springer, 3-540-28239-4. The full citation details ...](Pics/full.jpeg) |
2005 |
DBLP DOI BibTeX RDF |
|
13 | Ofer Dekel, Joseph Keshet, Yoram Singer |
Large margin hierarchical classification. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ICML ![In: Machine Learning, Proceedings of the Twenty-first International Conference (ICML 2004), Banff, Alberta, Canada, July 4-8, 2004, 2004, ACM. The full citation details ...](Pics/full.jpeg) |
2004 |
DBLP DOI BibTeX RDF |
|
13 | Ofer Dekel, Joseph Keshet, Yoram Singer |
An Online Algorithm for Hierarchical Phoneme Classification. ![Search on Bibsonomy](Pics/bibsonomy.png) |
MLMI ![In: Machine Learning for Multimodal Interaction, First International Workshop,MLMI 2004, Martigny, Switzerland, June 21-23, 2004, Revised Selected Papers, pp. 146-158, 2004, Springer, 3-540-24509-X. The full citation details ...](Pics/full.jpeg) |
2004 |
DBLP DOI BibTeX RDF |
|
13 | Pavel Valtr 0001 |
Davenport-Schinzel Trees. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Comb. ![In: Comb. 23(1), pp. 151-184, 2003. The full citation details ...](Pics/full.jpeg) |
2003 |
DBLP DOI BibTeX RDF |
AMS Subject Classification (2000): 52C10, 68R15, 05C78, 68U05 |
Displaying result #1 - #100 of 125 (100 per page; Change: ) Pages: [ 1][ 2][ >>] |
|