Hits ?▲ |
Authors |
Title |
Venue |
Year |
Link |
Author keywords |
124 | James B. Orlin |
A Fast, Simpler Algorithm for the Matroid Parity Problem. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IPCO ![In: Integer Programming and Combinatorial Optimization, 13th International Conference, IPCO 2008, Bertinoro, Italy, May 26-28, 2008, Proceedings, pp. 240-258, 2008, Springer, 978-3-540-68886-0. The full citation details ...](Pics/full.jpeg) |
2008 |
DBLP DOI BibTeX RDF |
Matroid parity, matroid matching, matroid intersection, nonbipartite matching |
109 | Jon Lee 0001, Maxim Sviridenko, Jan Vondrák |
Matroid matching: the power of local search. ![Search on Bibsonomy](Pics/bibsonomy.png) |
STOC ![In: Proceedings of the 42nd ACM Symposium on Theory of Computing, STOC 2010, Cambridge, Massachusetts, USA, 5-8 June 2010, pp. 369-378, 2010, ACM, 978-1-4503-0050-6. The full citation details ...](Pics/full.jpeg) |
2010 |
DBLP DOI BibTeX RDF |
Sherali-Adams hierarchy, local search, matching, matroid |
91 | Piotr Berman, Martin Fürer, Alexander Zelikovsky |
Applications of the Linear Matroid Parity Algorithm to Approximating Steiner Trees. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CSR ![In: Computer Science - Theory and Applications, First International Symposium on Computer Science in Russia, CSR 2006, St. Petersburg, Russia, June 8-12, 2006, Proceedings, pp. 70-79, 2006, Springer, 3-540-34166-8. The full citation details ...](Pics/full.jpeg) |
2006 |
DBLP DOI BibTeX RDF |
parity matroid problem, Steiner trees, matroid, approximation ratio |
90 | B. V. Raghavendra Rao, Jayalal Sarma |
On the Complexity of Matroid Isomorphism Problems. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CSR ![In: Computer Science - Theory and Applications, Fourth International Computer Science Symposium in Russia, CSR 2009, Novosibirsk, Russia, August 18-23, 2009. Proceedings, pp. 286-298, 2009, Springer, 978-3-642-03350-6. The full citation details ...](Pics/full.jpeg) |
2009 |
DBLP DOI BibTeX RDF |
|
84 | Petr Hlinený |
On Matroid Representability and Minor Problems. ![Search on Bibsonomy](Pics/bibsonomy.png) |
MFCS ![In: Mathematical Foundations of Computer Science 2006, 31st International Symposium, MFCS 2006, Stará Lesná, Slovakia, August 28-September 1, 2006, Proceedings, pp. 505-516, 2006, Springer, 3-540-37791-3. The full citation details ...](Pics/full.jpeg) |
2006 |
DBLP DOI BibTeX RDF |
Matroid representability, spike, swirl. 2000 Math subject classification: 05B35, finite field, 68Q17, 68R05, minor |
72 | Petr Hlinený |
On Matroid Properties Definable in the MSO Logic. ![Search on Bibsonomy](Pics/bibsonomy.png) |
MFCS ![In: Mathematical Foundations of Computer Science 2003, 28th International Symposium, MFCS 2003, Bratislava, Slovakia, August 25-29, 2003, Proceedings, pp. 470-479, 2003, Springer, 3-540-40671-9. The full citation details ...](Pics/full.jpeg) |
2003 |
DBLP DOI BibTeX RDF |
MSO logic, parametrized complexity, matroid, branch-width |
65 | Dániel Marx |
A Parameterized View on Matroid Optimization Problems. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ICALP (1) ![In: Automata, Languages and Programming, 33rd International Colloquium, ICALP 2006, Venice, Italy, July 10-14, 2006, Proceedings, Part I, pp. 655-666, 2006, Springer, 3-540-35904-4. The full citation details ...](Pics/full.jpeg) |
2006 |
DBLP DOI BibTeX RDF |
|
65 | Tamás Fleiner |
A Matroid Generalization of the Stable Matching Polytope. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IPCO ![In: Integer Programming and Combinatorial Optimization, 8th International IPCO Conference, Utrecht, The Netherlands, June 13-15, 2001, Proceedings, pp. 105-114, 2001, Springer, 3-540-42225-0. The full citation details ...](Pics/full.jpeg) |
2001 |
DBLP DOI BibTeX RDF |
|
63 | Amos Beimel, Noam Livne, Carles Padró |
Matroids Can Be Far from Ideal Secret Sharing. ![Search on Bibsonomy](Pics/bibsonomy.png) |
TCC ![In: Theory of Cryptography, Fifth Theory of Cryptography Conference, TCC 2008, New York, USA, March 19-21, 2008., pp. 194-212, 2008, Springer, 978-3-540-78523-1. The full citation details ...](Pics/full.jpeg) |
2008 |
DBLP DOI BibTeX RDF |
|
63 | Francisco Santos |
On Delaunay Oriented Matroids for Convex Distance Functions. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Discret. Comput. Geom. ![In: Discret. Comput. Geom. 16(2), pp. 197-210, 1996. The full citation details ...](Pics/full.jpeg) |
1996 |
DBLP DOI BibTeX RDF |
|
57 | Petr Hlinený |
Branch-Width, Parse Trees, and Monadic Second-Order Logic for Matroids. ![Search on Bibsonomy](Pics/bibsonomy.png) |
STACS ![In: STACS 2003, 20th Annual Symposium on Theoretical Aspects of Computer Science, Berlin, Germany, February 27 - March 1, 2003, Proceedings, pp. 319-330, 2003, Springer, 3-540-00623-0. The full citation details ...](Pics/full.jpeg) |
2003 |
DBLP DOI BibTeX RDF |
representable matroid, fixed-parameter complexity, Classification: parametrized complexity and logic in computer science. (Math subjects 05B35, 68R05, 03D05.), monadic second-order logic, branch-width |
57 | Anthony J. Roy, John G. Stell |
Convexity in Discrete Space. ![Search on Bibsonomy](Pics/bibsonomy.png) |
COSIT ![In: Spatial Information Theory. Foundations of Geographic Information Science, International Conference, COSIT 2003, Ittingen, Switzerland, September 24-28, 2003, Proceedings, pp. 253-269, 2003, Springer, 3-540-20148-3. The full citation details ...](Pics/full.jpeg) |
2003 |
DBLP DOI BibTeX RDF |
Convexity axioms, alignment spaces, affine spaces, convex spaces, matroid algorithms, convex hull, discrete geometry, cell complexes, oriented matroids |
52 | Jon Lee 0001, Vahab S. Mirrokni, Viswanath Nagarajan, Maxim Sviridenko |
Non-monotone submodular maximization under matroid and knapsack constraints. ![Search on Bibsonomy](Pics/bibsonomy.png) |
STOC ![In: Proceedings of the 41st Annual ACM Symposium on Theory of Computing, STOC 2009, Bethesda, MD, USA, May 31 - June 2, 2009, pp. 323-332, 2009, ACM, 978-1-60558-506-2. The full citation details ...](Pics/full.jpeg) |
2009 |
DBLP DOI BibTeX RDF |
approximation algorithms, matroids, knapsacks, submodular functions |
52 | Taneli Mielikäinen, Esko Ukkonen |
The Complexity of Maximum Matroid-Greedoid Intersection. ![Search on Bibsonomy](Pics/bibsonomy.png) |
FCT ![In: Fundamentals of Computation Theory, 13th International Symposium, FCT 2001, Riga, Latvia, August 22-24, 2001, Proceedings, pp. 535-540, 2001, Springer, 3-540-42487-3. The full citation details ...](Pics/full.jpeg) |
2001 |
DBLP DOI BibTeX RDF |
|
52 | Takeaki Uno |
A New Approach for Speeding Up Enumeration Algorithms and Its Application for Matroid Bases. ![Search on Bibsonomy](Pics/bibsonomy.png) |
COCOON ![In: Computing and Combinatorics, 5th Annual International Conference, COCOON '99, Tokyo, Japan, July 26-28, 1999, Proceedings, pp. 349-359, 1999, Springer, 3-540-66200-6. The full citation details ...](Pics/full.jpeg) |
1999 |
DBLP DOI BibTeX RDF |
|
52 | Ying Xu 0001, Harold N. Gabow |
Fast Algorithms for Transversal Matroid Intersection Problems ![Search on Bibsonomy](Pics/bibsonomy.png) |
ISAAC ![In: Algorithms and Computation, 5th International Symposium, ISAAC '94, Beijing, P. R. China, August 25-27, 1994, Proceedings, pp. 625-633, 1994, Springer, 3-540-58325-4. The full citation details ...](Pics/full.jpeg) |
1994 |
DBLP DOI BibTeX RDF |
|
52 | Toshihiro Fujito |
A 2or3-Approximation of the Matroid Matching Problem. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ISAAC ![In: Algorithms and Computation, 4th International Symposium, ISAAC '93, Hong Kong, December 15-17, 1993, Proceedings, pp. 185-190, 1993, Springer, 3-540-57568-5. The full citation details ...](Pics/full.jpeg) |
1993 |
DBLP DOI BibTeX RDF |
|
52 | Ping Li 0064, Guizhen Liu |
The Edge Connectivity of Circuit Graphs of Matroids. ![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. 440-443, 2007, Springer, 978-3-540-72587-9. The full citation details ...](Pics/full.jpeg) |
2007 |
DBLP DOI BibTeX RDF |
circuit graph of matroid, Matroid, edge connectivity |
50 | Amos Beimel, Noam Livne |
On Matroids and Nonideal Secret Sharing. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IEEE Trans. Inf. Theory ![In: IEEE Trans. Inf. Theory 54(6), pp. 2626-2643, 2008. The full citation details ...](Pics/full.jpeg) |
2008 |
DBLP DOI BibTeX RDF |
|
50 | Jan Vondrák |
Optimal approximation for the submodular welfare problem in the value oracle model. ![Search on Bibsonomy](Pics/bibsonomy.png) |
STOC ![In: Proceedings of the 40th Annual ACM Symposium on Theory of Computing, Victoria, British Columbia, Canada, May 17-20, 2008, pp. 67-74, 2008, ACM, 978-1-60558-047-0. The full citation details ...](Pics/full.jpeg) |
2008 |
DBLP DOI BibTeX RDF |
combinatorial auctions, matroids, submodular functions |
50 | Satoru Iwata 0001, Kenjiro Takazawa |
The independent even factor problem. ![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. 1171-1180, 2007, SIAM, 978-0-898716-24-5. The full citation details ...](Pics/full.jpeg) |
2007 |
DBLP BibTeX RDF |
|
50 | Moshe Babaioff, Nicole Immorlica, Robert Kleinberg |
Matroids, secretary problems, and online mechanisms. ![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. 434-443, 2007, SIAM, 978-0-898716-24-5. The full citation details ...](Pics/full.jpeg) |
2007 |
DBLP BibTeX RDF |
|
50 | Amos Beimel, Noam Livne |
On Matroids and Non-ideal Secret Sharing. ![Search on Bibsonomy](Pics/bibsonomy.png) |
TCC ![In: Theory of Cryptography, Third Theory of Cryptography Conference, TCC 2006, New York, NY, USA, March 4-7, 2006, Proceedings, pp. 482-501, 2006, Springer, 3-540-32731-2. The full citation details ...](Pics/full.jpeg) |
2006 |
DBLP DOI BibTeX RDF |
|
50 | Heiner Ackermann, Heiko Röglin, Berthold Vöcking |
Pure Nash Equilibria in Player-Specific and Weighted Congestion Games. ![Search on Bibsonomy](Pics/bibsonomy.png) |
WINE ![In: Internet and Network Economics, Second International Workshop, WINE 2006, Patras, Greece, December 15-17, 2006, Proceedings, pp. 50-61, 2006, Springer, 3-540-68138-8. The full citation details ...](Pics/full.jpeg) |
2006 |
DBLP DOI BibTeX RDF |
|
50 | Siaw-Lynn Ng |
A Representation of a Family of Secret Sharing Matroids. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Des. Codes Cryptogr. ![In: Des. Codes Cryptogr. 30(1), pp. 5-19, 2003. The full citation details ...](Pics/full.jpeg) |
2003 |
DBLP DOI BibTeX RDF |
projective geometry, matroids, ideal secret sharing schemes |
47 | Joachim Reichel, Martin Skutella |
Evolutionary algorithms and matroid optimization problems. ![Search on Bibsonomy](Pics/bibsonomy.png) |
GECCO ![In: Genetic and Evolutionary Computation Conference, GECCO 2007, Proceedings, London, England, UK, July 7-11, 2007, pp. 947-954, 2007, ACM, 978-1-59593-697-4. The full citation details ...](Pics/full.jpeg) |
2007 |
DBLP DOI BibTeX RDF |
matroid intersection, minimum weight basis, evolutionary algorithms, matroids, randomized search heuristics |
45 | Frederik Armknecht, Matthias Krause 0001 |
Constructing Single- and Multi-output Boolean Functions with Maximal Algebraic Immunity. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ICALP (2) ![In: Automata, Languages and Programming, 33rd International Colloquium, ICALP 2006, Venice, Italy, July 10-14, 2006, Proceedings, Part II, pp. 180-191, 2006, Springer, 3-540-35907-9. The full citation details ...](Pics/full.jpeg) |
2006 |
DBLP DOI BibTeX RDF |
matroid union algorithm, boolean functions, algebraic attacks, Cryptographic primitives |
40 | 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 |
|
40 | 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 |
|
40 | James F. Geelen, Satoru Iwata 0001 |
Matroid Matching Via Mixed Skew-Symmetric Matrices. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Comb. ![In: Comb. 25(2), pp. 187-215, 2005. The full citation details ...](Pics/full.jpeg) |
2005 |
DBLP DOI BibTeX RDF |
Mathematics Subject Classification (2000): 05C70 |
40 | Bianca Spille, Robert Weismantel |
A Generalization of Edmonds' Matching and Matroid Intersection Algorithms. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IPCO ![In: Integer Programming and Combinatorial Optimization, 9th International IPCO Conference, Cambridge, MA, USA, May 27-29, 2002, Proceedings, pp. 9-20, 2002, Springer, 3-540-43676-6. The full citation details ...](Pics/full.jpeg) |
2002 |
DBLP DOI BibTeX RDF |
|
40 | Shusaku Tsumoto |
Rule and Matroid Theory. ![Search on Bibsonomy](Pics/bibsonomy.png) |
COMPSAC ![In: 26th International Computer Software and Applications Conference (COMPSAC 2002), Prolonging Software Life: Development and Redevelopment, 26-29 August 2002, Oxford, England, Proceedings, pp. 1176-1181, 2002, IEEE Computer Society, 0-7695-1727-7. The full citation details ...](Pics/full.jpeg) |
2002 |
DBLP DOI BibTeX RDF |
|
40 | 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 |
|
40 | Jovan Dj. Golic |
On Matroid Characterization of Ideal Secret Sharing Schemes. ![Search on Bibsonomy](Pics/bibsonomy.png) |
J. Cryptol. ![In: J. Cryptol. 11(2), pp. 75-86, 1998. The full citation details ...](Pics/full.jpeg) |
1998 |
DBLP DOI BibTeX RDF |
Matroids, Matroids, Key words, Ideal secret sharing schemes, Ideal secret sharing schemes, Access structures, Access structures |
40 | David Eppstein |
Geometric Lower Bounds for Parametric Matroid Optimization. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Discret. Comput. Geom. ![In: Discret. Comput. Geom. 20(4), pp. 463-476, 1998. The full citation details ...](Pics/full.jpeg) |
1998 |
DBLP DOI BibTeX RDF |
|
40 | Alexander Barg |
The Matroid of Supports of A Linear Code. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Appl. Algebra Eng. Commun. Comput. ![In: Appl. Algebra Eng. Commun. Comput. 8(2), pp. 165-172, 1997. The full citation details ...](Pics/full.jpeg) |
1997 |
DBLP DOI BibTeX RDF |
Support weight distributions, Mac-Williams equation, Tutte polynomial |
40 | Peter Kleinschmidt, Shmuel Onn |
Oriented Matroid Polytopes and Polyhedral Fans are Signable. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IPCO ![In: Integer Programming and Combinatorial Optimization, 4th International IPCO Conference, Copenhagen, Denmark, May 29-31, 1995, Proceedings, pp. 198-211, 1995, Springer, 3-540-59408-6. The full citation details ...](Pics/full.jpeg) |
1995 |
DBLP DOI BibTeX RDF |
|
40 | Harold N. Gabow, Matthias F. M. Stallmann |
Efficient Algorithms for Graphic Matroid Intersection and Parity (Extended Abstract). ![Search on Bibsonomy](Pics/bibsonomy.png) |
ICALP ![In: Automata, Languages and Programming, 12th Colloquium, Nafplion, Greece, July 15-19, 1985, Proceedings, pp. 210-220, 1985, Springer, 3-540-15650-X. The full citation details ...](Pics/full.jpeg) |
1985 |
DBLP DOI BibTeX RDF |
|
39 | Vladimir I. Danilov, Gleb A. Koshevoy |
Choice Functions and Extensive Operators. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Order ![In: Order 26(1), pp. 69-94, 2009. The full citation details ...](Pics/full.jpeg) |
2009 |
DBLP DOI BibTeX RDF |
Pre-topology, Anti-matroid, Exchange and anti-exchange conditions, Matroid, Closure operator, Neighborhood system, Direct image |
38 | Jaume Martí-Farré, Carles Padró |
Ideal secret sharing schemes whose minimal qualified subsets have at most three participants. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Des. Codes Cryptogr. ![In: Des. Codes Cryptogr. 52(1), pp. 1-14, 2009. The full citation details ...](Pics/full.jpeg) |
2009 |
DBLP DOI BibTeX RDF |
Mathematics Subject Classification (2000) 94A62, 05B35 |
38 | Mijail Borges-Quintana, Miguel A. Borges-Trenard, Edgar Martínez-Moro |
Gröbner Representations of Binary Matroids. ![Search on Bibsonomy](Pics/bibsonomy.png) |
AAECC ![In: Applied Algebra, Algebraic Algorithms and Error-Correcting Codes, 18th International Symposium, AAECC-18 2009, Tarragona, Catalonia, Spain, June 8-12, 2009. Proceedings, pp. 227-230, 2009, Springer, 978-3-642-02180-0. The full citation details ...](Pics/full.jpeg) |
2009 |
DBLP DOI BibTeX RDF |
|
38 | Jaume Martí-Farré, Carles Padró |
On Secret Sharing Schemes, Matroids and Polymatroids. ![Search on Bibsonomy](Pics/bibsonomy.png) |
TCC ![In: Theory of Cryptography, 4th Theory of Cryptography Conference, TCC 2007, Amsterdam, The Netherlands, February 21-24, 2007, Proceedings, pp. 273-290, 2007, Springer, 3-540-70935-5. The full citation details ...](Pics/full.jpeg) |
2007 |
DBLP DOI BibTeX RDF |
Ideal access structures, Secret sharing, Matroids, Ideal secret sharing schemes, Information rate, Polymatroids |
38 | Balázs Szegedy, Christian Szegedy |
Symplectic Spaces And Ear-Decomposition Of Matroids. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Comb. ![In: Comb. 26(3), pp. 353-377, 2006. The full citation details ...](Pics/full.jpeg) |
2006 |
DBLP DOI BibTeX RDF |
Mathematics Subject Classification (2000): 05C70, 05C85, 05C50 |
38 | Satoru Fujishige, Satoru Iwata 0001 |
Bisubmodular Function Minimization. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IPCO ![In: Integer Programming and Combinatorial Optimization, 8th International IPCO Conference, Utrecht, The Netherlands, June 13-15, 2001, Proceedings, pp. 160-169, 2001, Springer, 3-540-42225-0. The full citation details ...](Pics/full.jpeg) |
2001 |
DBLP DOI BibTeX RDF |
|
38 | Takeaki Uno |
A New Approach for Speeding Up Enumeration Algorithms. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ISAAC ![In: Algorithms and Computation, 9th International Symposium, ISAAC '98, Taejon, Korea, December 14-16, 1998, Proceedings, pp. 287-296, 1998, Springer, 3-540-65385-6. The full citation details ...](Pics/full.jpeg) |
1998 |
DBLP DOI BibTeX RDF |
|
38 | Kaoru Kurosawa, Koji Okada, Keiichi Sakano, Wakaha Ogata, Shigeo Tsujii |
Nonperfect Secret Sharing Schemes and Matroids. ![Search on Bibsonomy](Pics/bibsonomy.png) |
EUROCRYPT ![In: Advances in Cryptology - EUROCRYPT '93, Workshop on the Theory and Application of of Cryptographic Techniques, Lofthus, Norway, May 23-27, 1993, Proceedings, pp. 126-141, 1993, Springer, 3-540-57600-2. The full citation details ...](Pics/full.jpeg) |
1993 |
DBLP DOI BibTeX RDF |
|
32 | Andrew Brzezinski, Gil Zussman, Eytan H. Modiano |
Distributed throughput maximization in wireless mesh networks via pre-partitioning. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IEEE/ACM Trans. Netw. ![In: IEEE/ACM Trans. Netw. 16(6), pp. 1406-1419, 2008. The full citation details ...](Pics/full.jpeg) |
2008 |
DBLP DOI BibTeX RDF |
local pooling, matroid intersection, scheduling, distributed algorithms, stability, channel assignment |
32 | Leonid Khachiyan, Endre Boros, Konrad Borys, Khaled M. Elbassioni, Vladimir Gurvich, Kazuhisa Makino |
Generating Cut Conjunctions in Graphs and Related Problems. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Algorithmica ![In: Algorithmica 51(3), pp. 239-263, 2008. The full citation details ...](Pics/full.jpeg) |
2008 |
DBLP DOI BibTeX RDF |
Cut conjunction, Cut generation, Graph, Matroid, Multicut |
32 | Petr Hlinený, Sang-il Oum |
Finding Branch-Decompositions and Rank-Decompositions. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ESA ![In: Algorithms - ESA 2007, 15th Annual European Symposium, Eilat, Israel, October 8-10, 2007, Proceedings, pp. 163-174, 2007, Springer, 978-3-540-75519-7. The full citation details ...](Pics/full.jpeg) |
2007 |
DBLP DOI BibTeX RDF |
Rank-width, fixed parameter tractable algorithm, graph, matroid, clique-width, branch-width |
32 | Andrew Brzezinski, Gil Zussman, Eytan H. Modiano |
Enabling distributed throughput maximization in wireless mesh networks: a partitioning approach. ![Search on Bibsonomy](Pics/bibsonomy.png) |
MobiCom ![In: Proceedings of the 12th Annual International Conference on Mobile Computing and Networking, MOBICOM 2006, Los Angeles, CA, USA, September 23-29, 2006, pp. 26-37, 2006, ACM, 1-59593-286-0. The full citation details ...](Pics/full.jpeg) |
2006 |
DBLP DOI BibTeX RDF |
local pooling, matroid intersection, scheduling, distributed algorithms, stability, wireless mesh networks, channel assignment |
32 | Zhenghao Zhang, Yuanyuan Yang |
Optimal Scheduling Algorithms in WDM Optical Interconnects with Limited Range Wavelength Conversion Capability. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Asia-Pacific Computer Systems Architecture Conference ![In: Advances in Computer Systems Architecture, 9th Asia-Pacific Conference, ACSAC 2004, Beijing, China, September 7-9, 2004, Proceedings, pp. 335-348, 2004, Springer, 3-540-23003-3. The full citation details ...](Pics/full.jpeg) |
2004 |
DBLP DOI BibTeX RDF |
scheduling, bipartite graphs, optical interconnects, Wavelength-division-multiplexing (WDM), matroid, wavelength conversion, bipartite matching, limited range wavelength conversion |
32 | Petr Hlinený, Detlef Seese |
On Decidability of MSO Theories of Representable Matroids. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IWPEC ![In: Parameterized and Exact Computation, First International Workshop, IWPEC 2004, Bergen, Norway, September 14-17, 2004, Proceedings, pp. 96-107, 2004, Springer, 3-540-23071-8. The full citation details ...](Pics/full.jpeg) |
2004 |
DBLP DOI BibTeX RDF |
MSO theory, decidability, matroid, branch-width |
32 | Dan Gusfield |
Haplotyping as perfect phylogeny: conceptual framework and efficient solutions. ![Search on Bibsonomy](Pics/bibsonomy.png) |
RECOMB ![In: Proceedings of the Sixth Annual International Conference on Computational Biology, RECOMB 2002, Washington, DC, USA, April 18-21, 2002, pp. 166-175, 2002, ACM, 1-58113-498-3. The full citation details ...](Pics/full.jpeg) |
2002 |
DBLP DOI BibTeX RDF |
graph realization, graphic matroid recognition, haplotype inference, perfect phylogeny |
32 | Ulrich Faigle, Walter Kern |
An Order-theoretic Framework for the Greedy Algorithm with Applications to the Core and Weber Set of Cooperative Games. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Order ![In: Order 17(4), pp. 353-375, 2000. The full citation details ...](Pics/full.jpeg) |
2000 |
DBLP DOI BibTeX RDF |
antimatroid, coöperative game, Monge algorithm, Weber set, greedy algorithm, core, poset, matroid, submodular |
29 | Benjamin Jany |
The Projectivization Matroid of a \(\boldsymbol{q}\) -Matroid. ![Search on Bibsonomy](Pics/bibsonomy.png) |
SIAM J. Appl. Algebra Geom. ![In: SIAM J. Appl. Algebra Geom. 7(2), pp. 386-413, June 2023. The full citation details ...](Pics/full.jpeg) |
2023 |
DBLP DOI BibTeX RDF |
|
29 | Richard Santiago, Ivan Sergeev, Rico Zenklusen |
Constant-Competitiveness for Random Assignment Matroid Secretary Without Knowing the Matroid. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CoRR ![In: CoRR abs/2305.05353, 2023. The full citation details ...](Pics/full.jpeg) |
2023 |
DBLP DOI BibTeX RDF |
|
29 | Michaela Borzechowski, Simon Weber 0001 |
On Degeneracy in the P-Matroid Oriented Matroid Complementarity Problem. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CoRR ![In: CoRR abs/2302.14585, 2023. The full citation details ...](Pics/full.jpeg) |
2023 |
DBLP DOI BibTeX RDF |
|
29 | Richard Santiago, Ivan Sergeev, Rico Zenklusen |
Constant-Competitiveness for Random Assignment Matroid Secretary Without Knowing the Matroid. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IPCO ![In: Integer Programming and Combinatorial Optimization - 24th International Conference, IPCO 2023, Madison, WI, USA, June 21-23, 2023, Proceedings, pp. 423-437, 2023, Springer, 978-3-031-32725-4. The full citation details ...](Pics/full.jpeg) |
2023 |
DBLP DOI BibTeX RDF |
|
29 | Benjamin Jany |
The Projectivization Matroid of a q-Matroid. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CoRR ![In: CoRR abs/2204.01232, 2022. The full citation details ...](Pics/full.jpeg) |
2022 |
DBLP DOI BibTeX RDF |
|
29 | Michael Bamiloshin, Aner Ben-Efraim, Oriol Farràs, Carles Padró |
Common information, matroid representation, and secret sharing for matroid ports. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Des. Codes Cryptogr. ![In: Des. Codes Cryptogr. 89(1), pp. 143-166, 2021. The full citation details ...](Pics/full.jpeg) |
2021 |
DBLP DOI BibTeX RDF |
|
29 | Moein Pourbaba, Habib Azanchiler, Ghodratolah Azadi |
A new matroid constructed by the rank function of a matroid. ![Search on Bibsonomy](Pics/bibsonomy.png) |
AKCE Int. J. Graphs Comb. ![In: AKCE Int. J. Graphs Comb. 17(1), pp. 65-69, 2020. The full citation details ...](Pics/full.jpeg) |
2020 |
DBLP DOI BibTeX RDF |
|
29 | Michael Bamiloshin, Aner Ben-Efraim, Oriol Farràs, Carles Padró |
Common Information, Matroid Representation, and Secret Sharing for Matroid Ports. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CoRR ![In: CoRR abs/2002.08108, 2020. The full citation details ...](Pics/full.jpeg) |
2020 |
DBLP BibTeX RDF |
|
29 | Csaba Király 0001, Zoltán Szigeti, Shin-ichi Tanigawa |
Packing of arborescences with matroid constraints via matroid intersection. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Math. Program. ![In: Math. Program. 181(1), pp. 85-117, 2020. The full citation details ...](Pics/full.jpeg) |
2020 |
DBLP DOI BibTeX RDF |
|
29 | Jinyu Huang |
Parallel algorithms for matroid intersection and matroid parity. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Discret. Math. Algorithms Appl. ![In: Discret. Math. Algorithms Appl. 7(2), pp. 1550019:1-1550019:19, 2015. The full citation details ...](Pics/full.jpeg) |
2015 |
DBLP DOI BibTeX RDF |
|
29 | Jinyu Huang |
Parallel Complexity for Matroid Intersection and Matroid Parity Problems. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Electron. Colloquium Comput. Complex. ![In: Electron. Colloquium Comput. Complex. TR12, 2012. The full citation details ...](Pics/full.jpeg) |
2012 |
DBLP BibTeX RDF |
|
29 | Yanfang Liu, William Zhu 0001 |
The role of covering matroid in covering-based rough set and matroid ![Search on Bibsonomy](Pics/bibsonomy.png) |
CoRR ![In: CoRR abs/1209.4978, 2012. The full citation details ...](Pics/full.jpeg) |
2012 |
DBLP BibTeX RDF |
|
29 | Hong-Jian Lai, Hongyuan Lai |
Every Matroid Is a Submatroid of a Uniformly Dense Matroid. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Discret. Appl. Math. ![In: Discret. Appl. Math. 63(2), pp. 151-160, 1995. The full citation details ...](Pics/full.jpeg) |
1995 |
DBLP DOI BibTeX RDF |
|
29 | Alexander I. Barvinok |
New algorithms for linear k-matroid intersection and matroid k-parity problems. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Math. Program. ![In: Math. Program. 69, pp. 449-470, 1995. The full citation details ...](Pics/full.jpeg) |
1995 |
DBLP DOI BibTeX RDF |
|
29 | James B. Orlin, John H. Vande Vate |
Solving the Linear Matroid Parity Problem as a Sequence of Matroid Intersection Problems. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Math. Program. ![In: Math. Program. 47, pp. 81-106, 1990. The full citation details ...](Pics/full.jpeg) |
1990 |
DBLP DOI BibTeX RDF |
|
29 | Horst W. Hamacher |
A time expanded matroid algorithm for finding optimal dynamic matroid intersections. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Z. Oper. Research ![In: Z. Oper. Research 29(5), pp. 203-215, 1985. The full citation details ...](Pics/full.jpeg) |
1985 |
DBLP DOI BibTeX RDF |
|
29 | Annie Astié-Vidal |
Factor group of the automorphism group of a matroid basis graph with respect to the automorphism group of the matroid. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Discret. Math. ![In: Discret. Math. 32(3), pp. 217-224, 1980. The full citation details ...](Pics/full.jpeg) |
1980 |
DBLP DOI BibTeX RDF |
|
27 | Jonah Blasiak |
The toric ideal of a graphic matroid is generated by quadrics. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Comb. ![In: Comb. 28(3), pp. 283-297, 2008. The full citation details ...](Pics/full.jpeg) |
2008 |
DBLP DOI BibTeX RDF |
Mathematics Subject Classification (2000) 05B35, 05C05 |
27 | André Berger, Vincenzo Bonifaci, Fabrizio Grandoni 0001, Guido Schäfer |
Budgeted Matching and Budgeted Matroid Intersection Via the Gasoline Puzzle. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IPCO ![In: Integer Programming and Combinatorial Optimization, 13th International Conference, IPCO 2008, Bertinoro, Italy, May 26-28, 2008, Proceedings, pp. 273-287, 2008, Springer, 978-3-540-68886-0. The full citation details ...](Pics/full.jpeg) |
2008 |
DBLP DOI BibTeX RDF |
|
27 | Nicholas J. A. Harvey |
Matroid intersection, pointer chasing, and Young's seminormal representation of Sn. ![Search on Bibsonomy](Pics/bibsonomy.png) |
SODA ![In: Proceedings of the Nineteenth Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2008, San Francisco, California, USA, January 20-22, 2008, pp. 542-549, 2008, SIAM. The full citation details ...](Pics/full.jpeg) |
2008 |
DBLP BibTeX RDF |
|
27 | Gruia Calinescu, Chandra Chekuri, Martin Pál, Jan Vondrák |
Maximizing a Submodular Set Function Subject to a Matroid Constraint (Extended Abstract). ![Search on Bibsonomy](Pics/bibsonomy.png) |
IPCO ![In: Integer Programming and Combinatorial Optimization, 12th International IPCO Conference, Ithaca, NY, USA, June 25-27, 2007, Proceedings, pp. 182-196, 2007, Springer, 978-3-540-72791-0. The full citation details ...](Pics/full.jpeg) |
2007 |
DBLP DOI BibTeX RDF |
|
27 | Manoel Lemos |
Weight Distribution of the Bases of a Matroid. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Graphs Comb. ![In: Graphs Comb. 22(1), pp. 69-82, 2006. The full citation details ...](Pics/full.jpeg) |
2006 |
DBLP DOI BibTeX RDF |
|
27 | Xun Dong |
On the Bounded Complex of an Affine Oriented Matroid. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Discret. Comput. Geom. ![In: Discret. Comput. Geom. 35(3), pp. 457-471, 2006. The full citation details ...](Pics/full.jpeg) |
2006 |
DBLP DOI BibTeX RDF |
|
27 | Sergey Bereg |
Algorithms for the d-Dimensional Rigidity Matroid of Sparse Graphs. ![Search on Bibsonomy](Pics/bibsonomy.png) |
JCDCG ![In: Discrete and Computational Geometry, Japanese Conference, JCDCG 2004, Tokyo, Japan, October 8-11, 2004, Revised Selected Papers, pp. 29-36, 2004, Springer, 3-540-30467-3. The full citation details ...](Pics/full.jpeg) |
2004 |
DBLP DOI BibTeX RDF |
|
27 | Francesc Serratosa, Antoni Grau, Alberto Sanfeliu |
Distance between 2D-Scenes based on Oriented Matroid Theory. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ICPR (2) ![In: 17th International Conference on Pattern Recognition, ICPR 2004, Cambridge, UK, August 23-26, 2004., pp. 196-199, 2004, IEEE Computer Society, 0-7695-2128-2. The full citation details ...](Pics/full.jpeg) |
2004 |
DBLP DOI BibTeX RDF |
|
27 | Víctor Dalmau, Daniel K. Ford |
Generalized Satisfability with Limited Occurrences per Variable: A Study through Delta-Matroid Parity. ![Search on Bibsonomy](Pics/bibsonomy.png) |
MFCS ![In: Mathematical Foundations of Computer Science 2003, 28th International Symposium, MFCS 2003, Bratislava, Slovakia, August 25-29, 2003, Proceedings, pp. 358-367, 2003, Springer, 3-540-40671-9. The full citation details ...](Pics/full.jpeg) |
2003 |
DBLP DOI BibTeX RDF |
|
27 | Ernesto Staffetti, Antoni Grau, Francesc Serratosa, Alberto Sanfeliu |
Shape Representation and Indexing Based on Region Connection Calculus and Oriented Matroid Theory. ![Search on Bibsonomy](Pics/bibsonomy.png) |
DGCI ![In: Discrete Geometry for Computer Imagery, 11th International Conference, DGCI 2003, Naples, Italy, November 19-21, 2003, Proceedings, pp. 267-276, 2003, Springer, 3-540-20499-7. The full citation details ...](Pics/full.jpeg) |
2003 |
DBLP DOI BibTeX RDF |
|
27 | Kenji Kashiwabara, Yoshio Okamoto, Takeaki Uno |
Matroid Representation of Clique Complexes. ![Search on Bibsonomy](Pics/bibsonomy.png) |
COCOON ![In: Computing and Combinatorics, 9th Annual International Conference, COCOON 2003, Big Sky, MT, USA, July 25-28, 2003, Proceedings, pp. 192-201, 2003, Springer, 3-540-40534-8. The full citation details ...](Pics/full.jpeg) |
2003 |
DBLP DOI BibTeX RDF |
|
27 | Alexander Golynski, Joseph Douglas Horton |
A Polynomial Time Algorithm to Find the Minimum Cycle Basis of a Regular Matroid. ![Search on Bibsonomy](Pics/bibsonomy.png) |
SWAT ![In: Algorithm Theory - SWAT 2002, 8th Scandinavian Workshop on Algorithm Theory, Turku, Finland, July 3-5, 2002 Proceedings, pp. 200-209, 2002, Springer, 3-540-43866-1. The full citation details ...](Pics/full.jpeg) |
2002 |
DBLP DOI BibTeX RDF |
|
27 | T. Ramalingom, Krishnaiyan Thulasiraman, Anindya Das |
A Matroid-Theoretic Solution to an Assignment Problem in the Conformance Testing of Communication Protocols. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IEEE Trans. Computers ![In: IEEE Trans. Computers 49(4), pp. 317-330, 2000. The full citation details ...](Pics/full.jpeg) |
2000 |
DBLP DOI BibTeX RDF |
algorithms, communication, Protocol, graph theory, communication protocol, matroids, protocol testing |
27 | Oliver Kullmann |
An Application of Matroid Theory to the SAT Problem. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CCC ![In: Proceedings of the 15th Annual IEEE Conference on Computational Complexity, Florence, Italy, July 4-7, 2000, pp. 116-, 2000, IEEE Computer Society, 0-7695-0674-7. The full citation details ...](Pics/full.jpeg) |
2000 |
DBLP DOI BibTeX RDF |
|
27 | Felipe Fernández, Ángel Sánchez |
Application of Multidimensional Retiming and Matroid Theory to DSP Algorithm Parallelization. ![Search on Bibsonomy](Pics/bibsonomy.png) |
EUROMICRO ![In: 25th EUROMICRO '99 Conference, Informatics: Theory and Practice for the New Millenium, 8-10 September 1999, Milan, Italy, pp. 1511-1518, 1999, IEEE Computer Society, 0-7695-0321-7. The full citation details ...](Pics/full.jpeg) |
1999 |
DBLP DOI BibTeX RDF |
|
27 | Greg N. Frederickson, Roberto Solis-Oba |
Algorithms for Measuring Perturbability in Matroid Optimization. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Comb. ![In: Comb. 18(4), pp. 503-518, 1998. The full citation details ...](Pics/full.jpeg) |
1998 |
DBLP DOI BibTeX RDF |
AMS Subject Classification (1991) Classes: 05B35, 0504, 68R05 |
27 | David Peleg |
Distributed Matroid Basis Completion via Elimination Upcast and Distributed Correction of Minimum-Weight Spanning Trees. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ICALP ![In: Automata, Languages and Programming, 25th International Colloquium, ICALP'98, Aalborg, Denmark, July 13-17, 1998, Proceedings, pp. 164-175, 1998, Springer, 3-540-64781-3. The full citation details ...](Pics/full.jpeg) |
1998 |
DBLP DOI BibTeX RDF |
|
27 | Qicheng Yu, Carl Sechen |
Efficient approximation of symbolic network functions using matroid intersection algorithms. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IEEE Trans. Comput. Aided Des. Integr. Circuits Syst. ![In: IEEE Trans. Comput. Aided Des. Integr. Circuits Syst. 16(10), pp. 1073-1081, 1997. The full citation details ...](Pics/full.jpeg) |
1997 |
DBLP DOI BibTeX RDF |
|
25 | Shaddin Dughmi, Tim Roughgarden, Mukund Sundararajan |
Revenue Submodularity. ![Search on Bibsonomy](Pics/bibsonomy.png) |
AMMA ![In: Auctions, Market Mechanisms and Their Applications, First International ICST Conference, AMMA 2009, Boston, MA, USA, May 8-9, 2009, Revised Selected Papers, pp. 89-91, 2009, Springer, 978-3-642-03820-4. The full citation details ...](Pics/full.jpeg) |
2009 |
DBLP DOI BibTeX RDF |
|
25 | Moshe Babaioff, Jason D. Hartline, Robert D. Kleinberg |
Selling ad campaigns: online algorithms with cancellations. ![Search on Bibsonomy](Pics/bibsonomy.png) |
EC ![In: Proceedings 10th ACM Conference on Electronic Commerce (EC-2009), Stanford, California, USA, July 6--10, 2009, pp. 61-70, 2009, ACM, 978-1-60558-458-4. The full citation details ...](Pics/full.jpeg) |
2009 |
DBLP DOI BibTeX RDF |
costly decision revocation, selling advertisements, online algorithms, matroids, knapsack |
25 | Shaddin Dughmi, Tim Roughgarden, Mukund Sundararajan |
Revenue submodularity. ![Search on Bibsonomy](Pics/bibsonomy.png) |
EC ![In: Proceedings 10th ACM Conference on Electronic Commerce (EC-2009), Stanford, California, USA, July 6--10, 2009, pp. 243-252, 2009, ACM, 978-1-60558-458-4. The full citation details ...](Pics/full.jpeg) |
2009 |
DBLP DOI BibTeX RDF |
market expansion, efficiency, monotonicity, trade-offs, revenue, submodularity, vcg, optimal auctions |
25 | Heiner Ackermann, Heiko Röglin, Berthold Vöcking |
On the impact of combinatorial structure on congestion games. ![Search on Bibsonomy](Pics/bibsonomy.png) |
J. ACM ![In: J. ACM 55(6), pp. 25:1-25:22, 2008. The full citation details ...](Pics/full.jpeg) |
2008 |
DBLP DOI BibTeX RDF |
convergence, local search, Nash equilibria, Congestion games |
25 | Navin Kashyap |
A Decomposition Theory for Binary Linear Codes. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IEEE Trans. Inf. Theory ![In: IEEE Trans. Inf. Theory 54(7), pp. 3035-3058, 2008. The full citation details ...](Pics/full.jpeg) |
2008 |
DBLP DOI BibTeX RDF |
|
25 | Tamás Király, Lap Chi Lau, Mohit Singh |
Degree Bounded Matroids and Submodular Flows. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IPCO ![In: Integer Programming and Combinatorial Optimization, 13th International Conference, IPCO 2008, Bertinoro, Italy, May 26-28, 2008, Proceedings, pp. 259-272, 2008, Springer, 978-3-540-68886-0. The full citation details ...](Pics/full.jpeg) |
2008 |
DBLP DOI BibTeX RDF |
|
25 | Matthew Cary, Abraham D. Flaxman, Jason D. Hartline, Anna R. Karlin |
Auctions for structured procurement. ![Search on Bibsonomy](Pics/bibsonomy.png) |
SODA ![In: Proceedings of the Nineteenth Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2008, San Francisco, California, USA, January 20-22, 2008, pp. 304-313, 2008, SIAM. The full citation details ...](Pics/full.jpeg) |
2008 |
DBLP BibTeX RDF |
|
25 | Heiner Ackermann, Paul W. Goldberg, Vahab S. Mirrokni, Heiko Röglin, Berthold Vöcking |
A Unified Approach to Congestion Games and Two-Sided Markets. ![Search on Bibsonomy](Pics/bibsonomy.png) |
WINE ![In: Internet and Network Economics, Third International Workshop, WINE 2007, San Diego, CA, USA, December 12-14, 2007, Proceedings, pp. 30-41, 2007, Springer, 978-3-540-77104-3. The full citation details ...](Pics/full.jpeg) |
2007 |
DBLP DOI BibTeX RDF |
|
25 | Mark Jerrum |
Two Remarks Concerning Balanced Matroids. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Comb. ![In: Comb. 26(6), pp. 733-742, 2006. The full citation details ...](Pics/full.jpeg) |
2006 |
DBLP DOI BibTeX RDF |
Mathematics Subject Classification (2000): 05B35, 05A99, 51E10, 68Q17 |
25 | Heiner Ackermann, Heiko Röglin, Berthold Vöcking |
On the Impact of Combinatorial Structure on Congestion Games. ![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. 613-622, 2006, IEEE Computer Society, 0-7695-2720-5. The full citation details ...](Pics/full.jpeg) |
2006 |
DBLP DOI BibTeX RDF |
|
25 | Iwan M. Duursma |
Combinatorics of the Two-Variable Zeta Function. ![Search on Bibsonomy](Pics/bibsonomy.png) |
International Conference on Finite Fields and Applications ![In: Finite Fields and Applications, 7th International Conference, Fq7, Toulouse, France, May 5-9, 2003, Revised Papers, pp. 109-136, 2003, Springer, 3-540-21324-4. The full citation details ...](Pics/full.jpeg) |
2003 |
DBLP DOI BibTeX RDF |
|