|
|
|
|
Venues (Conferences, Journals, ...)
|
|
|
GrowBag graphs for keyword ? (Num. hits/coverage)
Group by:
The graphs summarize 5 occurrences of 5 keywords
|
|
|
|
|
Results
Found 15 publication records. Showing 15 according to the selection in the facets
| Hits ?▲ |
Authors |
Title |
Venue |
Year |
Link |
Author keywords |
| 1 | J. C. M. Keijsper, Rudi Pendavingh |
Convex minization over Z2.  |
Oper. Res. Lett.  |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Rudi Pendavingh, Stefan H. M. van Zwam |
Lifts of matroid representations over partial fields. |
J. Comb. Theory, Ser. B |
2010 |
DBLP DOI BibTeX RDF |
|
| 1 | Rudi Pendavingh, Stefan H. M. van Zwam |
Confinement of matroid representations to subsets of partial fields. |
J. Comb. Theory, Ser. B |
2010 |
DBLP DOI BibTeX RDF |
|
| 1 | Hein van der Holst, Rudi Pendavingh |
On a graph property generalizing planarity and flatness. |
Combinatorica |
2009 |
DBLP DOI BibTeX RDF |
|
| 1 | Cor A. J. Hurkens, Rudi Pendavingh, Gerhard J. Woeginger |
The Magnus-Derek game revisited. |
Inf. Process. Lett. |
2008 |
DBLP DOI BibTeX RDF |
|
| 1 | Rudi Pendavingh, Quintijn Puite, Gerhard J. Woeginger |
2-piercings via graph theory. |
Discrete Applied Mathematics |
2008 |
DBLP DOI BibTeX RDF |
|
| 1 | Rudi Pendavingh, Stefan H. M. van Zwam |
New Korkin--Zolotarev Inequalities. |
SIAM Journal on Optimization |
2007 |
DBLP DOI BibTeX RDF |
|
| 1 | Kamalika Chaudhuri, Anshul Kothari, Rudi Pendavingh, Ram Swaminathan, Robert Endre Tarjan, Yunhong Zhou |
Server Allocation Algorithms for Tiered Systems. |
Algorithmica |
2007 |
DBLP DOI BibTeX RDF |
|
| 1 | Judith Keijsper, Rudi Pendavingh, Leen Stougie |
A linear programming formulation of Mader's edge-disjoint paths problem. |
J. Comb. Theory, Ser. B |
2006 |
DBLP DOI BibTeX RDF |
|
| 1 | Kamalika Chaudhuri, Anshul Kothari, Rudi Pendavingh, Ram Swaminathan, Robert Endre Tarjan, Yunhong Zhou |
Server Allocation Algorithms for Tiered Systems. |
COCOON |
2005 |
DBLP DOI BibTeX RDF |
|
| 1 | Rudi Pendavingh, Petra Schuurman, Gerhard J. Woeginger |
Recognizing DNA graphs is difficult. |
Discrete Applied Mathematics |
2003 |
DBLP DOI BibTeX RDF |
|
| 1 | Rudi Pendavingh, Petra Schuurman, Gerhard J. Woeginger |
De Bruijn Graphs and DNA Graphs. |
WG |
2001 |
DBLP DOI BibTeX RDF |
De Bruijn graph, DNA graphs, computational complexity, graph theory, NP-hardness, DNA computing, recognition algorithm |
| 1 | Judith Keijsper, Rudi Pendavingh, Alexander Schrijver |
Adjacency, Inseparability, and Base Orderability in Matroids. |
Eur. J. Comb. |
2000 |
DBLP DOI BibTeX RDF |
|
| 1 | Judith Keijsper, Rudi Pendavingh |
An Efficient Algorithm for Minimum-Weight Bibranching. |
J. Comb. Theory, Ser. B |
1998 |
DBLP DOI BibTeX RDF |
|
| 1 | Rudi Pendavingh |
On the Relation Between Two Minor-Monotone Graph Parameters. |
Combinatorica |
1998 |
DBLP DOI BibTeX RDF |
AMS Subject Classification (1991) Classes: 05C |
Displaying result #1 - #15 of 15 (100 per page; Change: )
|
|
![[Valid RSS]](Pics/valid-rss.png "Validate my RSS feed")