|
|
Venues (Conferences, Journals, ...)
|
|
GrowBag graphs for keyword ? (Num. hits/coverage)
Group by:
The graphs summarize 1325 occurrences of 797 keywords
|
|
|
Results
Found 5953 publication records. Showing 5953 according to the selection in the facets
Hits ?▲ |
Authors |
Title |
Venue |
Year |
Link |
Author keywords |
15 | Jiong Guo, Falk Hüffner, Christian Komusiewicz, Yong Zhang 0053 |
Improved Algorithms for Bicluster Editing. ![Search on Bibsonomy](Pics/bibsonomy.png) |
TAMC ![In: Theory and Applications of Models of Computation, 5th International Conference, TAMC 2008, Xi'an, China, April 25-29, 2008. Proceedings, pp. 445-456, 2008, Springer, 978-3-540-79227-7. The full citation details ...](Pics/full.jpeg) |
2008 |
DBLP DOI BibTeX RDF |
|
15 | Masayuki Yoshino, Katsuyuki Okeya, Camille Vuillaume |
A Black Hen Lays White Eggs. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CARDIS ![In: Smart Card Research and Advanced Applications, 8th IFIP WG 8.8/11.2 International Conference, CARDIS 2008, London, UK, September 8-11, 2008. Proceedings, pp. 74-88, 2008, Springer, 978-3-540-85892-8. The full citation details ...](Pics/full.jpeg) |
2008 |
DBLP DOI BibTeX RDF |
double-size technique, RSA, smartcard, Montgomery multiplication, efficient implementation |
15 | C. Greg Plaxton |
Fast Scheduling of Weighted Unit Jobs with Release Times and Deadlines. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ICALP (1) ![In: Automata, Languages and Programming, 35th International Colloquium, ICALP 2008, Reykjavik, Iceland, July 7-11, 2008, Proceedings, Part I: Tack A: Algorithms, Automata, Complexity, and Games, pp. 222-233, 2008, Springer, 978-3-540-70574-1. The full citation details ...](Pics/full.jpeg) |
2008 |
DBLP DOI BibTeX RDF |
|
15 | Stefano Crespi-Reghizzi, Pierluigi San Pietro |
Consensual Definition of Languages by Regular Sets. ![Search on Bibsonomy](Pics/bibsonomy.png) |
LATA ![In: Language and Automata Theory and Applications, Second International Conference, LATA 2008, Tarragona, Spain, March 13-19, 2008. Revised Papers, pp. 196-208, 2008, Springer, 978-3-540-88281-7. The full citation details ...](Pics/full.jpeg) |
2008 |
DBLP DOI BibTeX RDF |
|
15 | Patrik Floréen, Marja Hassinen, Petteri Kaski, Jukka Suomela |
Tight Local Approximation Results for Max-Min Linear Programs. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ALGOSENSORS ![In: Algorithmic Aspects of Wireless Sensor Networks, Fourth International Workshop, ALGOSENSORS 2008, Reykjavik, Iceland, July 2008. Revised Selected Papers, pp. 2-17, 2008, Springer, 978-3-540-92861-4. The full citation details ...](Pics/full.jpeg) |
2008 |
DBLP DOI BibTeX RDF |
|
15 | Gilles Brassard, André Allan Méthot |
Strict Hierarchy of Bell Theorems. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ICQNM ![In: Second International Conference on Quantum, Nano, and Micro Technologies, ICQNM 2008, February 10-15, 2008, Sainte Luce, Martinique, French Caribbean, pp. 98-103, 2008, IEEE Computer Society, 978-0-7695-3085-7. The full citation details ...](Pics/full.jpeg) |
2008 |
DBLP DOI BibTeX RDF |
Bell theorem, Bell theorem without inequalities, Pseudo-telepathy, Entanglement |
15 | Martin Fürer, Shiva Prasad Kasiviswanathan |
Approximately Counting Embeddings into Random Graphs. ![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. 416-429, 2008, Springer, 978-3-540-85362-6. The full citation details ...](Pics/full.jpeg) |
2008 |
DBLP DOI BibTeX RDF |
|
15 | Pim van 't Hof, Daniël Paulusma |
A New Characterization of P6-Free Graphs. ![Search on Bibsonomy](Pics/bibsonomy.png) |
COCOON ![In: Computing and Combinatorics, 14th Annual International Conference, COCOON 2008, Dalian, China, June 27-29, 2008, Proceedings, pp. 415-424, 2008, Springer, 978-3-540-69732-9. The full citation details ...](Pics/full.jpeg) |
2008 |
DBLP DOI BibTeX RDF |
|
15 | Sadish Sadasivam, Huaming Zhang |
On Representation of Planar Graphs by Segments. ![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. 304-315, 2008, Springer, 978-3-540-68865-5. The full citation details ...](Pics/full.jpeg) |
2008 |
DBLP DOI BibTeX RDF |
|
15 | Peter Hui, Michael J. Pelsmajer, Marcus Schaefer 0001, Daniel Stefankovic |
Train Tracks and Confluent Drawings. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Algorithmica ![In: Algorithmica 47(4), pp. 465-479, 2007. The full citation details ...](Pics/full.jpeg) |
2007 |
DBLP DOI BibTeX RDF |
|
15 | Marc Demange, Dominique de Werra, Jérôme Monnot, Vangelis Th. Paschos |
Time slot scheduling of compatible jobs. ![Search on Bibsonomy](Pics/bibsonomy.png) |
J. Sched. ![In: J. Sched. 10(2), pp. 111-127, 2007. The full citation details ...](Pics/full.jpeg) |
2007 |
DBLP DOI BibTeX RDF |
Weighted coloring, Chromatic scheduling, Approximations, Edge coloring, Batch scheduling |
15 | Piotr Sankowski |
Faster dynamic matchings and vertex connectivity. ![Search on Bibsonomy](Pics/bibsonomy.png) |
SODA ![In: Proceedings of the Eighteenth Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2007, New Orleans, Louisiana, USA, January 7-9, 2007, pp. 118-126, 2007, SIAM, 978-0-898716-24-5. The full citation details ...](Pics/full.jpeg) |
2007 |
DBLP BibTeX RDF |
|
15 | Nicholas J. A. Harvey |
An algebraic algorithm for weighted linear matroid intersection. ![Search on Bibsonomy](Pics/bibsonomy.png) |
SODA ![In: Proceedings of the Eighteenth Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2007, New Orleans, Louisiana, USA, January 7-9, 2007, pp. 444-453, 2007, SIAM, 978-0-898716-24-5. The full citation details ...](Pics/full.jpeg) |
2007 |
DBLP BibTeX RDF |
|
15 | Luciana S. Buriol, Gereon Frahling, Stefano Leonardi 0001, Christian Sohler |
Estimating Clustering Indexes in Data Streams. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ESA ![In: Algorithms - ESA 2007, 15th Annual European Symposium, Eilat, Israel, October 8-10, 2007, Proceedings, pp. 618-632, 2007, Springer, 978-3-540-75519-7. The full citation details ...](Pics/full.jpeg) |
2007 |
DBLP DOI BibTeX RDF |
|
15 | Samir Datta, Raghav Kulkarni, Nutan Limaye, Meena Mahajan |
Planarity, Determinants, Permanents, and (Unique) Matchings. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CSR ![In: Computer Science - Theory and Applications, Second International Symposium on Computer Science in Russia, CSR 2007, Ekaterinburg, Russia, September 3-7, 2007, Proceedings, pp. 115-126, 2007, Springer, 978-3-540-74509-9. The full citation details ...](Pics/full.jpeg) |
2007 |
DBLP DOI BibTeX RDF |
|
15 | Manindra Agrawal, Thanh Minh Hoang, Thomas Thierauf |
The Polynomially Bounded Perfect Matching Problem Is in NC 2. ![Search on Bibsonomy](Pics/bibsonomy.png) |
STACS ![In: STACS 2007, 24th Annual Symposium on Theoretical Aspects of Computer Science, Aachen, Germany, February 22-24, 2007, Proceedings, pp. 489-499, 2007, Springer, 978-3-540-70917-6. The full citation details ...](Pics/full.jpeg) |
2007 |
DBLP DOI BibTeX RDF |
|
15 | Bing Bai, Paul B. Kantor, Ali Shokoufandeh, Deborah Silver |
fMRI Brain Image Retrieval Based on ICA Components. ![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. 10-17, 2007, IEEE Computer Society, 0-7695-2899-6. The full citation details ...](Pics/full.jpeg) |
2007 |
DBLP DOI BibTeX RDF |
|
15 | Jianxin Wang 0001, Xiaoshuang Xu, Yunlong Liu 0001 |
An Exact Algorithm Based on Chain Implication for the Min-CVCB Problem. ![Search on Bibsonomy](Pics/bibsonomy.png) |
COCOA ![In: Combinatorial Optimization and Applications, First International Conference, COCOA 2007, Xi'an, China, August 14-16, 2007, Proceedings, pp. 343-353, 2007, Springer, 978-3-540-73555-7. The full citation details ...](Pics/full.jpeg) |
2007 |
DBLP DOI BibTeX RDF |
|
15 | Luca Trevisan |
Fun with Sub-linear Time Algorithms. ![Search on Bibsonomy](Pics/bibsonomy.png) |
FUN ![In: Fun with Algorithms, 4th International Conference, FUN 2007, Castiglioncello, Italy, June 3-5, 2007, Proceedings, pp. 15, 2007, Springer, 978-3-540-72913-6. The full citation details ...](Pics/full.jpeg) |
2007 |
DBLP DOI BibTeX RDF |
|
15 | Tim Paulden, David K. Smith 0002 |
From the Dandelion Code to the Rainbow Code: A Class of Bijective Spanning Tree Representations With Linear Complexity and Bounded Locality. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IEEE Trans. Evol. Comput. ![In: IEEE Trans. Evol. Comput. 10(2), pp. 108-123, 2006. The full citation details ...](Pics/full.jpeg) |
2006 |
DBLP DOI BibTeX RDF |
|
15 | Poompat Saengudomlert, Eytan H. Modiano, Robert G. Gallager |
On-line routing and wavelength assignment for dynamic traffic in WDM ring and torus networks. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IEEE/ACM Trans. Netw. ![In: IEEE/ACM Trans. Netw. 14(2), pp. 330-340, 2006. The full citation details ...](Pics/full.jpeg) |
2006 |
DBLP DOI BibTeX RDF |
graph theory, routing and wavelength assignment, WDM networks |
15 | Michele Conforti, Gérard Cornuéjols, Giacomo Zambelli |
Decomposing Berge Graphs Containing No Proper Wheel, Long Prism Or Their Complements. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Comb. ![In: Comb. 26(5), pp. 533-558, 2006. The full citation details ...](Pics/full.jpeg) |
2006 |
DBLP DOI BibTeX RDF |
Mathematics Subject Classification (2000): 05C17 |
15 | Mohammad R. Salavatipour |
Large Induced Forests in Triangle-Free Planar Graphs. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Graphs Comb. ![In: Graphs Comb. 22(1), pp. 113-126, 2006. The full citation details ...](Pics/full.jpeg) |
2006 |
DBLP DOI BibTeX RDF |
|
15 | Hannah Bast, Kurt Mehlhorn, Guido Schäfer, Hisao Tamaki |
Matching Algorithms Are Fast in Sparse Random Graphs. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Theory Comput. Syst. ![In: Theory Comput. Syst. 39(1), pp. 3-14, 2006. The full citation details ...](Pics/full.jpeg) |
2006 |
DBLP DOI BibTeX RDF |
|
15 | Mark E. O'Sullivan |
Algebraic construction of sparse matrices with large girth. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IEEE Trans. Inf. Theory ![In: IEEE Trans. Inf. Theory 52(2), pp. 718-727, 2006. The full citation details ...](Pics/full.jpeg) |
2006 |
DBLP DOI BibTeX RDF |
|
15 | Daniela Kühn, Deryk Osthus |
Critical chromatic number and the complexity of perfect packings in 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. 851-859, 2006, ACM Press, 0-89871-605-5. The full citation details ...](Pics/full.jpeg) |
2006 |
DBLP DOI BibTeX RDF |
|
15 | Michael P. McGarry, Martin Reisslein, Violet R. Syrotiuk |
Access control in heterogeneous multichannel wireless networks. ![Search on Bibsonomy](Pics/bibsonomy.png) |
InterSense ![In: Proceedings of the First International Conference in Integrated Internet Ad Hoc and Sensor Networks, InterSense 2006, Nice, France, May 30-31, 2006, pp. 15, 2006, ACM, 1-59593-427-8. The full citation details ...](Pics/full.jpeg) |
2006 |
DBLP DOI BibTeX RDF |
|
15 | Nicholas J. A. Harvey |
Algebraic Structures and Algorithms for Matching and Matroid Problems. ![Search on Bibsonomy](Pics/bibsonomy.png) |
FOCS ![In: 47th Annual IEEE Symposium on Foundations of Computer Science (FOCS 2006), 21-24 October 2006, Berkeley, California, USA, Proceedings, pp. 531-542, 2006, IEEE Computer Society, 0-7695-2720-5. The full citation details ...](Pics/full.jpeg) |
2006 |
DBLP DOI BibTeX RDF |
|
15 | Qiankun Zhao, Tie-Yan Liu, Sourav S. Bhowmick, Wei-Ying Ma |
Event detection from evolution of click-through data. ![Search on Bibsonomy](Pics/bibsonomy.png) |
KDD ![In: Proceedings of the Twelfth ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, Philadelphia, PA, USA, August 20-23, 2006, pp. 484-493, 2006, ACM, 1-59593-339-5. The full citation details ...](Pics/full.jpeg) |
2006 |
DBLP DOI BibTeX RDF |
dynamic web, evolution pattern, event detection, click-through data |
15 | Michael Dom, Jiong Guo, Falk Hüffner, Rolf Niedermeier, Anke Truß |
Fixed-Parameter Tractability Results for Feedback Set Problems in Tournaments. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CIAC ![In: Algorithms and Complexity, 6th Italian Conference, CIAC 2006, Rome, Italy, May 29-31, 2006, Proceedings, pp. 320-331, 2006, Springer, 3-540-34375-X. The full citation details ...](Pics/full.jpeg) |
2006 |
DBLP DOI BibTeX RDF |
|
15 | Benjamin Doerr |
Generating Randomized Roundings with Cardinality Constraints and Derandomizations. ![Search on Bibsonomy](Pics/bibsonomy.png) |
STACS ![In: STACS 2006, 23rd Annual Symposium on Theoretical Aspects of Computer Science, Marseille, France, February 23-25, 2006, Proceedings, pp. 571-583, 2006, Springer, 978-3-540-32301-3. The full citation details ...](Pics/full.jpeg) |
2006 |
DBLP DOI BibTeX RDF |
|
15 | Andris Ambainis, Robert Spalek |
Quantum Algorithms for Matching and Network Flows. ![Search on Bibsonomy](Pics/bibsonomy.png) |
STACS ![In: STACS 2006, 23rd Annual Symposium on Theoretical Aspects of Computer Science, Marseille, France, February 23-25, 2006, Proceedings, pp. 172-183, 2006, Springer, 978-3-540-32301-3. The full citation details ...](Pics/full.jpeg) |
2006 |
DBLP DOI BibTeX RDF |
|
15 | Barnaby Martin, Florent R. Madelaine |
Towards a Trichotomy for Quantified H-Coloring. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CiE ![In: Logical Approaches to Computational Barriers, Second Conference on Computability in Europe, CiE 2006, Swansea, UK, June 30-July 5, 2006, Proceedings, pp. 342-352, 2006, Springer, 3-540-35466-2. The full citation details ...](Pics/full.jpeg) |
2006 |
DBLP DOI BibTeX RDF |
|
15 | Boaz Barak, Anup Rao 0001, Ronen Shaltiel, Avi Wigderson |
2-source dispersers for sub-polynomial entropy and Ramsey graphs beating the Frankl-Wilson construction. ![Search on Bibsonomy](Pics/bibsonomy.png) |
STOC ![In: Proceedings of the 38th Annual ACM Symposium on Theory of Computing, Seattle, WA, USA, May 21-23, 2006, pp. 671-680, 2006, ACM, 1-59593-134-1. The full citation details ...](Pics/full.jpeg) |
2006 |
DBLP DOI BibTeX RDF |
independent sources, extractors, dispersers, Ramsey graphs |
15 | Julia Chuzhoy, Sanjeev Khanna |
Hardness of cut problems in directed graphs. ![Search on Bibsonomy](Pics/bibsonomy.png) |
STOC ![In: Proceedings of the 38th Annual ACM Symposium on Theory of Computing, Seattle, WA, USA, May 21-23, 2006, pp. 527-536, 2006, ACM, 1-59593-134-1. The full citation details ...](Pics/full.jpeg) |
2006 |
DBLP DOI BibTeX RDF |
directed multicut, hardness of approximation, sparsest cut |
15 | Rajeev Motwani 0001, Rina Panigrahy, Ying Xu 0002 |
Fractional Matching Via Balls-and-Bins. ![Search on Bibsonomy](Pics/bibsonomy.png) |
APPROX-RANDOM ![In: Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques, 9th International Workshop on Approximation Algorithms for Combinatorial Optimization Problems, APPROX 2006 and 10th International Workshop on Randomization and Computation, RANDOM 2006, Barcelona, Spain, August 28-30 2006, Proceedings, pp. 487-498, 2006, Springer, 3-540-38044-2. The full citation details ...](Pics/full.jpeg) |
2006 |
DBLP DOI BibTeX RDF |
|
15 | Fábio Protti, Maise Dantas da Silva, Jayme Luiz Szwarcfiter |
Applying Modular Decomposition to Parameterized Bicluster Editing. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IWPEC ![In: Parameterized and Exact Computation, Second International Workshop, IWPEC 2006, Zürich, Switzerland, September 13-15, 2006, Proceedings, pp. 1-12, 2006, Springer, 3-540-39098-7. The full citation details ...](Pics/full.jpeg) |
2006 |
DBLP DOI BibTeX RDF |
edge modification problems, bicluster graphs, NP-complete problems, fixed-parameter tractability, cluster graphs |
15 | Daniel H. Ho, Shahrokh Valaee |
Information Raining and Optimal Link-Layer Design for Mobile Hotspots. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IEEE Trans. Mob. Comput. ![In: IEEE Trans. Mob. Comput. 4(3), pp. 271-284, 2005. The full citation details ...](Pics/full.jpeg) |
2005 |
DBLP DOI BibTeX RDF |
mobile hotspots, graph theory, linear programming, wireless communication, medium access control, network protocols, constrained optimization, Emerging technologies, mobile environments, combinatorial algorithms, mobile communication systems, graphs and networks, network architecture and design |
15 | Danny Z. Chen, Xiaobo Sharon Hu, Shuang Luan, Xiaodong Wu 0001, Cedric X. Yu |
Optimal Terrain Construction Problems and Applications in Intensity-Modulated Radiation Therapy. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Algorithmica ![In: Algorithmica 42(3-4), pp. 265-288, 2005. The full citation details ...](Pics/full.jpeg) |
2005 |
DBLP DOI BibTeX RDF |
Leaf sequencing, Algorithms, Intensity-modulated radiation therapy |
15 | Hiroshi Nagamochi |
An Improved Bound on the One-Sided Minimum Crossing Number in Two-Layered Drawings. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Discret. Comput. Geom. ![In: Discret. Comput. Geom. 33(4), pp. 569-591, 2005. The full citation details ...](Pics/full.jpeg) |
2005 |
DBLP DOI BibTeX RDF |
|
15 | J. Orestes Cerdeira, Leonor Santiago Pinto |
Requiring Connectivity in the Set Covering Problem. ![Search on Bibsonomy](Pics/bibsonomy.png) |
J. Comb. Optim. ![In: J. Comb. Optim. 9(1), pp. 35-47, 2005. The full citation details ...](Pics/full.jpeg) |
2005 |
DBLP DOI BibTeX RDF |
integer polytopes, graphs, set covering, connected components |
15 | Khaled M. Elbassioni, Irit Katriel, Martin Kutz, Meena Mahajan |
Simultaneous Matchings. ![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. 106-115, 2005, Springer, 3-540-30935-7. The full citation details ...](Pics/full.jpeg) |
2005 |
DBLP DOI BibTeX RDF |
|
15 | Gek Ling Chia, V. L. Chia |
On the Choice Numbers of Some Complete Multipartite Graphs. ![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. 30-37, 2005, Springer, 978-3-540-70665-6. The full citation details ...](Pics/full.jpeg) |
2005 |
DBLP DOI BibTeX RDF |
|
15 | Noga Alon, Asaf Shapira, Benny Sudakov |
Additive Approximation for Edge-Deletion Problems. ![Search on Bibsonomy](Pics/bibsonomy.png) |
FOCS ![In: 46th Annual IEEE Symposium on Foundations of Computer Science (FOCS 2005), 23-25 October 2005, Pittsburgh, PA, USA, Proceedings, pp. 419-428, 2005, IEEE Computer Society, 0-7695-2468-0. The full citation details ...](Pics/full.jpeg) |
2005 |
DBLP DOI BibTeX RDF |
|
15 | Sriram V. Pemmaraju, Rajiv Raman 0001 |
Approximation Algorithms for the Max-coloring Problem. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ICALP ![In: Automata, Languages and Programming, 32nd International Colloquium, ICALP 2005, Lisbon, Portugal, July 11-15, 2005, Proceedings, pp. 1064-1075, 2005, Springer, 3-540-27580-0. The full citation details ...](Pics/full.jpeg) |
2005 |
DBLP DOI BibTeX RDF |
|
15 | Jan-Jan Wu, Pangfeng Liu |
Distributed Scheduling of Parallel I/O in the Presence of Data Replication. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IPDPS ![In: 19th International Parallel and Distributed Processing Symposium (IPDPS 2005), CD-ROM / Abstracts Proceedings, 4-8 April 2005, Denver, CO, USA, 2005, IEEE Computer Society, 0-7695-2312-9. The full citation details ...](Pics/full.jpeg) |
2005 |
DBLP DOI BibTeX RDF |
|
15 | Jianyong Duan, Yi Hu, Ruzhan Lu, Yan Tian, Hui Liu 0002 |
Bilingual Semantic Network Construction. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ICIC (2) ![In: Advances in Intelligent Computing, International Conference on Intelligent Computing, ICIC 2005, Hefei, China, August 23-26, 2005, Proceedings, Part II, pp. 548-557, 2005, Springer, 3-540-28227-0. The full citation details ...](Pics/full.jpeg) |
2005 |
DBLP DOI BibTeX RDF |
|
15 | Kazuhiro Kazama, Osamu Katai, Shin-ya Sato, Hiroshi Kawakami |
Web Community Discovery Using Personal Names. ![Search on Bibsonomy](Pics/bibsonomy.png) |
WIRI ![In: 2005 International Workshop on Challenges in Web Information Retrieval and Integration (WIRI 2005), 8-9 April 2005, Tokyo, Japan, pp. 113-121, 2005, IEEE Computer Society, 0-7695-2414-1. The full citation details ...](Pics/full.jpeg) |
2005 |
DBLP DOI BibTeX RDF |
|
15 | Natwar Modani, Yogish Sabharwal, S. Karthik |
A Framework for Session Based Recommendations. ![Search on Bibsonomy](Pics/bibsonomy.png) |
EC-Web ![In: E-Commerce and Web Technologies: 6th International Conference, EC-Web 2005, Copenhagen, Denmark, August 23-26, 2005, Proceedings, pp. 108-117, 2005, Springer, 3-540-28467-2. The full citation details ...](Pics/full.jpeg) |
2005 |
DBLP DOI BibTeX RDF |
|
15 | Ran Raz |
Extractors with weak random seeds. ![Search on Bibsonomy](Pics/bibsonomy.png) |
STOC ![In: Proceedings of the 37th Annual ACM Symposium on Theory of Computing, Baltimore, MD, USA, May 22-24, 2005, pp. 11-20, 2005, ACM, 1-58113-960-8. The full citation details ...](Pics/full.jpeg) |
2005 |
DBLP DOI BibTeX RDF |
random sources, extractors, pseudorandomness, condensers, mergers, randomness extraction, explicit constructions, Ramsey graphs |
15 | Boaz Barak, Guy Kindler, Ronen Shaltiel, Benny Sudakov, Avi Wigderson |
Simulating independence: new constructions of condensers, ramsey graphs, dispersers, and extractors. ![Search on Bibsonomy](Pics/bibsonomy.png) |
STOC ![In: Proceedings of the 37th Annual ACM Symposium on Theory of Computing, Baltimore, MD, USA, May 22-24, 2005, pp. 1-10, 2005, ACM, 1-58113-960-8. The full citation details ...](Pics/full.jpeg) |
2005 |
DBLP DOI BibTeX RDF |
dispersers condenser, constructions, extractors, explicit, ramsey graphs |
15 | Jonathan S. K. Chan, Victor O. K. Li, King-Shan Lui |
Scheduling algorithms for peer-to-peer collaborative file distribution. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CollaborateCom ![In: Proceedings of the 1st International Conference on Collaborative Computing: Networking, Applications and Worksharing, San Jose, CA, USA, December 19-21, 2005, 2005, IEEE Computer Society / ICST, 1-4244-0030-9. The full citation details ...](Pics/full.jpeg) |
2005 |
DBLP DOI BibTeX RDF |
|
15 | C. A. Rodger |
Hamilton Decomposable Graphs with Specified Leaves. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Graphs Comb. ![In: Graphs Comb. 20(4), pp. 541-543, 2004. The full citation details ...](Pics/full.jpeg) |
2004 |
DBLP DOI BibTeX RDF |
|
15 | Andreas Goerdt, André Lanka |
On the Hardness and Easiness of Random 4-SAT Formulas. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ISAAC ![In: Algorithms and Computation, 15th International Symposium, ISAAC 2004, Hong Kong, China, December 20-22, 2004, Proceedings, pp. 470-483, 2004, Springer, 3-540-24131-0. The full citation details ...](Pics/full.jpeg) |
2004 |
DBLP DOI BibTeX RDF |
|
15 | Feodor F. Dragan, Irina Lomonosov |
On Compact and Efficient Routing in Certain Graph Classes. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ISAAC ![In: Algorithms and Computation, 15th International Symposium, ISAAC 2004, Hong Kong, China, December 20-22, 2004, Proceedings, pp. 402-414, 2004, Springer, 3-540-24131-0. The full citation details ...](Pics/full.jpeg) |
2004 |
DBLP DOI BibTeX RDF |
|
15 | Marcin Mucha, Piotr Sankowski |
Maximum Matchings via Gaussian Elimination. ![Search on Bibsonomy](Pics/bibsonomy.png) |
FOCS ![In: 45th Symposium on Foundations of Computer Science (FOCS 2004), 17-19 October 2004, Rome, Italy, Proceedings, pp. 248-255, 2004, IEEE Computer Society, 0-7695-2228-9. The full citation details ...](Pics/full.jpeg) |
2004 |
DBLP DOI BibTeX RDF |
|
15 | Hui Jiang 0002, Chong-Wah Ngo |
Graph Based Image Matching. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ICPR (3) ![In: 17th International Conference on Pattern Recognition, ICPR 2004, Cambridge, UK, August 23-26, 2004., pp. 658-661, 2004, IEEE Computer Society, 0-7695-2128-2. The full citation details ...](Pics/full.jpeg) |
2004 |
DBLP DOI BibTeX RDF |
|
15 | Hannah Bast, Kurt Mehlhorn, Guido Schäfer, Hisao Tamaki |
Matching Algorithms Are Fast in Sparse Random Graphs. ![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. 81-92, 2004, Springer, 3-540-21236-1. The full citation details ...](Pics/full.jpeg) |
2004 |
DBLP DOI BibTeX RDF |
|
15 | Arvind Gupta, Ján Manuch, Ladislav Stacho |
Fault Tolerant Forwarding and Optical Indexes: A Design Theory Approach. ![Search on Bibsonomy](Pics/bibsonomy.png) |
SIROCCO ![In: Structural Information and Communication Complexity, 11th International Colloquium , SIROCCO 2004, Smolenice Castle, Slovakia, June 21-23, 2004, Proceedings, pp. 197-208, 2004, Springer, 3-540-22230-8. The full citation details ...](Pics/full.jpeg) |
2004 |
DBLP DOI BibTeX RDF |
|
15 | Noga Alon, Vera Asodi |
Edge Coloring with Delays. ![Search on Bibsonomy](Pics/bibsonomy.png) |
APPROX-RANDOM ![In: Approximation, Randomization, and Combinatorial Optimization, Algorithms and Techniques, 7th International Workshop on Approximation Algorithms for Combinatorial Optimization Problems, APPROX 2004, and 8th International Workshop on Randomization and Computation, RANDOM 2004, Cambridge, MA, USA, August 22-24, 2004, Proceedings, pp. 237-248, 2004, Springer, 3-540-22894-2. The full citation details ...](Pics/full.jpeg) |
2004 |
DBLP DOI BibTeX RDF |
|
15 | Andrej Bogdanov, Luca Trevisan |
Lower Bounds for Testing Bipartiteness in Dense Graphs. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CCC ![In: 19th Annual IEEE Conference on Computational Complexity (CCC 2004), 21-24 June 2004, Amherst, MA, USA, pp. 75-81, 2004, IEEE Computer Society, 0-7695-2120-7. The full citation details ...](Pics/full.jpeg) |
2004 |
DBLP DOI BibTeX RDF |
|
15 | Chingren Lee, Jenq Kuen Lee, TingTing Hwang, Shi-Chun Tsai |
Compiler optimization on VLIW instruction scheduling for low power. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ACM Trans. Design Autom. Electr. Syst. ![In: ACM Trans. Design Autom. Electr. Syst. 8(2), pp. 252-268, 2003. The full citation details ...](Pics/full.jpeg) |
2003 |
DBLP DOI BibTeX RDF |
VLIW instruction scheduling, instruction bus optimizations, low-power optimization, Compilers |
15 | Zhenhong Liu, Jianzhong Zhang 0001 |
On Inverse Problems of Optimum Perfect Matching. ![Search on Bibsonomy](Pics/bibsonomy.png) |
J. Comb. Optim. ![In: J. Comb. Optim. 7(3), pp. 215-228, 2003. The full citation details ...](Pics/full.jpeg) |
2003 |
DBLP DOI BibTeX RDF |
maximum-mean alternating cycle, ellipsoid method, linear programming, perfect matching, strongly polynomial algorithm, maximum-weight matching |
15 | Alex R. Berg, Tibor Jordán |
Algorithms for Graph Rigidity and Scene Analysis. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ESA ![In: Algorithms - ESA 2003, 11th Annual European Symposium, Budapest, Hungary, September 16-19, 2003, Proceedings, pp. 78-89, 2003, Springer, 3-540-20064-9. The full citation details ...](Pics/full.jpeg) |
2003 |
DBLP DOI BibTeX RDF |
|
15 | Luisa Gargano, Mikael Hammar |
There Are Spanning Spiders in Dense Graphs (and We Know How to Find Them). ![Search on Bibsonomy](Pics/bibsonomy.png) |
ICALP ![In: Automata, Languages and Programming, 30th International Colloquium, ICALP 2003, Eindhoven, The Netherlands, June 30 - July 4, 2003. Proceedings, pp. 802-816, 2003, Springer, 3-540-40493-7. The full citation details ...](Pics/full.jpeg) |
2003 |
DBLP DOI BibTeX RDF |
Graph theory, Graph and network algorithms |
15 | Farn Wang, Hsu-Chun Yen |
Timing Parameter Characterization of Real-Time Systems. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CIAA ![In: Implementation and Application of Automata, 8th International Conference, CIAA 2003, Santa Barbara, California, USA, July 16-18, 2003, Proceedings, pp. 23-34, 2003, Springer, 3-540-40561-5. The full citation details ...](Pics/full.jpeg) |
2003 |
DBLP DOI BibTeX RDF |
|
15 | Cécile Murat, Vangelis Th. Paschos |
The Probabilistic Minimum Coloring Problem. ![Search on Bibsonomy](Pics/bibsonomy.png) |
WG ![In: Graph-Theoretic Concepts in Computer Science, 29th International Workshop, WG 2003, Elspeet, The Netherlands, June 19-21, 2003, Revised Papers, pp. 346-357, 2003, Springer, 3-540-20452-0. The full citation details ...](Pics/full.jpeg) |
2003 |
DBLP DOI BibTeX RDF |
|
15 | Dariusz Dereniowski, Marek Kubale |
Cholesky Factorization of Matrices in Parallel and Ranking of Graphs. ![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. 985-992, 2003, Springer, 3-540-21946-3. The full citation details ...](Pics/full.jpeg) |
2003 |
DBLP DOI BibTeX RDF |
|
15 | Sandrine Lanquetin, Sebti Foufou, Hamamache Kheddouci, Marc Neveu |
A Graph Based Algorithm for Intersection of Subdivision Surfaces. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ICCSA (3) ![In: Computational Science and Its Applications - ICCSA 2003, International Conference, Montreal, Canada, May 18-21, 2003, Proceedings, Part III, pp. 387-396, 2003, Springer, 3-540-40156-3. The full citation details ...](Pics/full.jpeg) |
2003 |
DBLP DOI BibTeX RDF |
|
15 | Andreas Huck, Eberhard Triesch |
Perfect Matchings in Balanced Hypergraphs - A Combinatorial Approach. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Comb. ![In: Comb. 22(3), pp. 409-416, 2002. The full citation details ...](Pics/full.jpeg) |
2002 |
DBLP DOI BibTeX RDF |
AMS Subject Classification (2000) Classes: 05C65, 05C70 |
15 | Marc Demange, Dominique de Werra, Jérôme Monnot, Vangelis Th. Paschos |
Weighted Node Coloring: When Stable Sets Are Expensive. ![Search on Bibsonomy](Pics/bibsonomy.png) |
WG ![In: Graph-Theoretic Concepts in Computer Science, 28th International Workshop, WG 2002, Cesky Krumlov, Czech Republic, June 13-15, 2002, Revised Papers, pp. 114-125, 2002, Springer, 3-540-00331-2. The full citation details ...](Pics/full.jpeg) |
2002 |
DBLP DOI BibTeX RDF |
|
15 | Leslie Ann Goldberg, Steven Kelk, Mike Paterson |
The complexity of choosing an H-colouring (nearly) uniformly at random. ![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. 53-62, 2002, ACM, 1-58113-495-9. The full citation details ...](Pics/full.jpeg) |
2002 |
DBLP DOI BibTeX RDF |
|
15 | Zsolt Tuza, Annegret Wagler |
Minimally Non-Preperfect Graphs of Small Maximum Degree. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Graphs Comb. ![In: Graphs Comb. 17(4), pp. 759-773, 2001. The full citation details ...](Pics/full.jpeg) |
2001 |
DBLP DOI BibTeX RDF |
|
15 | Andrew B. Kahng, Shailesh Vaya, Alexander Zelikovsky |
New graph bipartizations for double-exposure, bright field alternating phase-shift mask layout. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ASP-DAC ![In: Proceedings of ASP-DAC 2001, Asia and South Pacific Design Automation Conference 2001, January 30-February 2, 2001, Yokohama, Japan, pp. 133-138, 2001, ACM, 0-7803-6634-4. The full citation details ...](Pics/full.jpeg) |
2001 |
DBLP DOI BibTeX RDF |
|
15 | Kurt Mehlhorn, Guido Schäfer |
A Heuristic for Dijkstra's Algorithm with Many Targets and Its Use in Weighted Matching Algorithms. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ESA ![In: Algorithms - ESA 2001, 9th Annual European Symposium, Aarhus, Denmark, August 28-31, 2001, Proceedings, pp. 242-253, 2001, Springer, 3-540-42493-8. The full citation details ...](Pics/full.jpeg) |
2001 |
DBLP DOI BibTeX RDF |
|
15 | Amit Chakrabarti, Subhash Khot |
Improved Lower Bounds on the Randomized Complexity of Graph Properties. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ICALP ![In: Automata, Languages and Programming, 28th International Colloquium, ICALP 2001, Crete, Greece, July 8-12, 2001, Proceedings, pp. 285-296, 2001, Springer, 3-540-42287-0. The full citation details ...](Pics/full.jpeg) |
2001 |
DBLP DOI BibTeX RDF |
Decision tree complexity, monotone graph properties, randomized complexity, graph packing, randomized algorithms, probabilistic method |
15 | Clemens Gröpl, Stefan Hougardy, Till Nierhoff, Hans Jürgen Prömel |
Lower Bounds for Approximation Algorithms for the Steiner Tree Problem. ![Search on Bibsonomy](Pics/bibsonomy.png) |
WG ![In: Graph-Theoretic Concepts in Computer Science, 27th International Workshop, WG 2001, Boltenhagen, Germany, June 14-16, 2001, Proceedings, pp. 217-228, 2001, Springer, 3-540-42707-4. The full citation details ...](Pics/full.jpeg) |
2001 |
DBLP DOI BibTeX RDF |
|
15 | Chuan-Ching Sue, Sy-Yen Kuo |
Restoration from Multiple Faults in WDM Networks without Wavelength Conversion. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ICN (1) ![In: Networking - ICN 2001, First International Conference, Colmar, France, July 9-13, 2001 Proceedings, Part 1, pp. 317-325, 2001, Springer, 3-540-42302-8. The full citation details ...](Pics/full.jpeg) |
2001 |
DBLP DOI BibTeX RDF |
|
15 | Eldar Fischer, Ilan Newman |
Testing of matrix properties. ![Search on Bibsonomy](Pics/bibsonomy.png) |
STOC ![In: Proceedings on 33rd Annual ACM Symposium on Theory of Computing, July 6-8, 2001, Heraklion, Crete, Greece, pp. 286-295, 2001, ACM, 1-58113-349-9. The full citation details ...](Pics/full.jpeg) |
2001 |
DBLP DOI BibTeX RDF |
matrix properties, property testing |
15 | Erich Prisner |
Bicliques in Graphs I: Bounds on Their Number. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Comb. ![In: Comb. 20(1), pp. 109-117, 2000. The full citation details ...](Pics/full.jpeg) |
2000 |
DBLP DOI BibTeX RDF |
AMS Subject Classification (1991) Classes: 05C |
15 | Chin Lung Lu, Sheng-Lung Peng, Chuan Yi Tang |
Efficient Minus and Signed Domination in Graphs. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ISAAC ![In: Algorithms and Computation, 11th International Conference, ISAAC 2000, Taipei, Taiwan, December 18-20, 2000, Proceedings, pp. 241-253, 2000, Springer, 3-540-41255-7. The full citation details ...](Pics/full.jpeg) |
2000 |
DBLP DOI BibTeX RDF |
|
15 | Tsuyoshi Murata |
Discovery of Web Communities Based on the Co-Occurence of References. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Discovery Science ![In: Discovery Science, Third International Conference, DS 2000, Kyoto, Japan, December 4-6, 2000, Proceedings, pp. 65-75, 2000, Springer, 3-540-41352-9. The full citation details ...](Pics/full.jpeg) |
2000 |
DBLP DOI BibTeX RDF |
|
15 | Shin-ichi Iwai, Kenjiro Ogawa, Morimasa Tsuchiya |
On Double Bound Graphs with Respect to Graph Operations. ![Search on Bibsonomy](Pics/bibsonomy.png) |
JCDCG ![In: Discrete and Computational Geometry, Japanese Conference, JCDCG 2000, Tokyo, Japan, November, 22-25, 2000, Revised Papers, pp. 167-175, 2000, Springer, 3-540-42306-0. The full citation details ...](Pics/full.jpeg) |
2000 |
DBLP DOI BibTeX RDF |
|
15 | Jean-Marc Lanlignel, Olivier Raynaud, Eric Thierry |
Pruning Graphs with Digital Search Trees. Application to Distance Hereditary Graphs. ![Search on Bibsonomy](Pics/bibsonomy.png) |
STACS ![In: STACS 2000, 17th Annual Symposium on Theoretical Aspects of Computer Science, Lille, France, February 2000, Proceedings, pp. 529-541, 2000, Springer, 3-540-67141-2. The full citation details ...](Pics/full.jpeg) |
2000 |
DBLP DOI BibTeX RDF |
|
15 | Bruno Courcelle |
Hierarchical Graph Decompositions Defined by Grammars and Logical Formulas. ![Search on Bibsonomy](Pics/bibsonomy.png) |
RTA ![In: Rewriting Techniques and Applications, 10th International Conference, RTA-99, Trento, Italy, July 2-4, 1999, Proceedings, pp. 90-91, 1999, Springer, 3-540-66201-4. The full citation details ...](Pics/full.jpeg) |
1999 |
DBLP DOI BibTeX RDF |
|
15 | Don Coppersmith, Gregory B. Sorkin |
Constructive Bounds and Exact Expectations for the Random Assignment Problem. ![Search on Bibsonomy](Pics/bibsonomy.png) |
RANDOM ![In: Randomization and Approximation Techniques in Computer Science, Second International Workshop, RANDOM'98, Barcelona, Spain, October 8-10, 1998, Proceedings, pp. 319-330, 1998, Springer, 3-540-65142-X. The full citation details ...](Pics/full.jpeg) |
1998 |
DBLP DOI BibTeX RDF |
|
15 | David P. DiVincenzo, Christopher A. Fuchs, Hideo Mabuchi, John A. Smolin, Ashish V. Thapliyal, Armin Uhlmann |
Entanglement of Assistance. ![Search on Bibsonomy](Pics/bibsonomy.png) |
QCQC ![In: Quantum Computing and Quantum Communications, First NASA International Conference, QCQC'98, Palm Springs, California, USA, February 17-20, 1998, Selected Papers, pp. 247-257, 1998, Springer, 3-540-65514-X. The full citation details ...](Pics/full.jpeg) |
1998 |
DBLP DOI BibTeX RDF |
|
15 | Yachyang Sun, Ting-Chi Wang, Chak-Kuen Wong, C. L. Liu 0001 |
Routing for symmetric FPGAs and FPICs. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IEEE Trans. Comput. Aided Des. Integr. Circuits Syst. ![In: IEEE Trans. Comput. Aided Des. Integr. Circuits Syst. 16(1), pp. 20-31, 1997. The full citation details ...](Pics/full.jpeg) |
1997 |
DBLP DOI BibTeX RDF |
|
15 | Sun-Yuan Hsieh, Gen-Huey Chen, Chin-Wen Ho |
Hamiltonian-Laceability of Star Graphs. ![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. 112-117, 1997, IEEE Computer Society, 0-8186-8259-0. The full citation details ...](Pics/full.jpeg) |
1997 |
DBLP DOI BibTeX RDF |
|
15 | Alon Efrat, Matthew J. Katz |
Computing Fair and Bottleneck Matchings in Geormetric Graphs. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ISAAC ![In: Algorithms and Computation, 7th International Symposium, ISAAC '96, Osaka, Japan, December 16-18, 1996, Proceedings, pp. 115-125, 1996, Springer, 3-540-62048-6. The full citation details ...](Pics/full.jpeg) |
1996 |
DBLP DOI BibTeX RDF |
|
15 | Kazuo Murota |
Combinatorial relaxation algorithm for the maximum degree of subdeterminants: Computing Smith-Mcmillan form at infinity and structural indices in Kronecker form. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Appl. Algebra Eng. Commun. Comput. ![In: Appl. Algebra Eng. Commun. Comput. 6(4/5), pp. 251-273, 1995. The full citation details ...](Pics/full.jpeg) |
1995 |
DBLP DOI BibTeX RDF |
combinatorial matrix theory, Kronecker form of matrix pencil, Smith-McMillan form of rational matrix, matching, determinant, computer algebra, polyhedral combinatorics |
15 | Pankaj K. Agarwal, Noga Alon, Boris Aronov, Subhash Suri |
Can Visibility Graphs be Represented Compactly? ![Search on Bibsonomy](Pics/bibsonomy.png) |
SCG ![In: Proceedings of the Ninth Annual Symposium on Computational GeometrySan Diego, CA, USA, May 19-21, 1993, pp. 338-347, 1993, ACM, 0-89791-582-8. The full citation details ...](Pics/full.jpeg) |
1993 |
DBLP DOI BibTeX RDF |
|
15 | W. T. Liou, Jimmy J. M. Tan, Richard C. T. Lee |
Minimum rectangular partition problem for simple rectilinear polygons. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IEEE Trans. Comput. Aided Des. Integr. Circuits Syst. ![In: IEEE Trans. Comput. Aided Des. Integr. Circuits Syst. 9(7), pp. 720-733, 1990. The full citation details ...](Pics/full.jpeg) |
1990 |
DBLP DOI BibTeX RDF |
|
15 | János Pach, Richard Pollack, Emo Welzl |
Weaving Patterns of Lines and Segments in Space. ![Search on Bibsonomy](Pics/bibsonomy.png) |
SIGAL International Symposium on Algorithms ![In: Algorithms, International Symposium SIGAL '90, Tokyo, Japan, August 16-18, 1990, Proceedings, pp. 439-446, 1990, Springer, 3-540-52921-7. The full citation details ...](Pics/full.jpeg) |
1990 |
DBLP DOI BibTeX RDF |
|
15 | Thomas F. Coleman, Anders Edenbrandt, John R. Gilbert |
Predicting fill for sparse orthogonal factorization. ![Search on Bibsonomy](Pics/bibsonomy.png) |
J. ACM ![In: J. ACM 33(3), pp. 517-532, 1986. The full citation details ...](Pics/full.jpeg) |
1986 |
DBLP DOI BibTeX RDF |
|
14 | Thomas Erlebach, Klaus Jansen, Christos Kaklamanis, Giuseppe Persiano |
Directed Tree Networks. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Encyclopedia of Optimization ![In: Encyclopedia of Optimization, Second Edition, pp. 716-725, 2009, Springer, 978-0-387-74758-3. The full citation details ...](Pics/full.jpeg) |
2009 |
DBLP DOI BibTeX RDF |
Bipartite edge coloring, Approximation algorithms, Optical networks, Path coloring |
14 | David Eppstein |
Testing bipartiteness of geometric intersection graphs. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ACM Trans. Algorithms ![In: ACM Trans. Algorithms 5(2), pp. 15:1-15:35, 2009. The full citation details ...](Pics/full.jpeg) |
2009 |
DBLP DOI BibTeX RDF |
Hopcroft's problem, coin graph, geometric thickness, graph coloring, minimum spanning tree, Bipartite graph, line segments, disks, intersection graph |
14 | Stéphan Clémençon, Marine Depecker, Nicolas Vayatis |
Bagging Ranking Trees. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ICMLA ![In: International Conference on Machine Learning and Applications, ICMLA 2009, Miami Beach, Florida, USA, December 13-15, 2009, pp. 658-663, 2009, IEEE Computer Society, 978-0-7695-3926-3. The full citation details ...](Pics/full.jpeg) |
2009 |
DBLP DOI BibTeX RDF |
Bipartite ranking, ROC optimization, consensus ranking, decision trees, bagging, rank aggregation |
14 | Tao Zhou 0001 |
Personal Recommendation in User-Object Networks. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Complex (1) ![In: Complex Sciences, First International Conference, Complex 2009, Shanghai, China, February 23-25, 2009. Revised Papers, Part 1, pp. 247-253, 2009, Springer, 978-3-642-02465-8. The full citation details ...](Pics/full.jpeg) |
2009 |
DBLP DOI BibTeX RDF |
Infophysics, User-Object Networks, Diffusion, Personal Recommendation, Bipartite Networks |
14 | Gagan Raj Gupta, Sujay Sanghavi, Ness B. Shroff |
Node weighted scheduling. ![Search on Bibsonomy](Pics/bibsonomy.png) |
SIGMETRICS/Performance ![In: Proceedings of the Eleventh International Joint Conference on Measurement and Modeling of Computer Systems, SIGMETRICS/Performance 2009, Seattle, WA, USA, June 15-19, 2009, pp. 97-108, 2009, ACM, 978-1-60558-511-6. The full citation details ...](Pics/full.jpeg) |
2009 |
DBLP DOI BibTeX RDF |
scheduling, switch, bipartite matching, fluid limits |
Displaying result #401 - #500 of 5953 (100 per page; Change: ) Pages: [ <<][ 1][ 2][ 3][ 4][ 5][ 6][ 7][ 8][ 9][ 10][ 11][ 12][ 13][ 14][ >>] |
|