|
|
|
|
Venues (Conferences, Journals, ...)
|
|
|
GrowBag graphs for keyword ? (Num. hits/coverage)
Group by:
The graphs summarize 9 occurrences of 9 keywords
|
|
|
|
|
Results
Found 28 publication records. Showing 28 according to the selection in the facets
| Hits ?▲ |
Authors |
Title |
Venue |
Year |
Link |
Author keywords |
| 1 | Nadja Betzler, Robert Bredereck, Rolf Niedermeier, Johannes Uhlmann |
On Bounded-Degree Vertex Deletion parameterized by treewidth.  |
Discrete Applied Mathematics  |
2012 |
DBLP DOI BibTeX RDF |
|
| 1 | Nadja Betzler, René van Bevern, Michael R. Fellows, Christian Komusiewicz, Rolf Niedermeier |
Parameterized Algorithmics for Finding Connected Motifs in Biological Networks. |
IEEE/ACM Trans. Comput. Biology Bioinform. |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Nadja Betzler, Jiong Guo, Christian Komusiewicz, Rolf Niedermeier |
Average parameterization and partial kernelization for computing medians. |
J. Comput. Syst. Sci. |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Nadja Betzler, Rolf Niedermeier, Gerhard J. Woeginger |
Unweighted Coalitional Manipulation under the Borda Rule Is NP-Hard. |
IJCAI |
2011 |
DBLP BibTeX RDF |
|
| 1 | Nadja Betzler, Robert Bredereck, Rolf Niedermeier, Johannes Uhlmann |
On Making a Distinguished Vertex Minimum Degree by Vertex Deletion. |
SOFSEM |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Nadja Betzler |
A Multivariate Complexity Analysis of Voting Problems. |
|
2010 |
RDF |
|
| 1 | Falk Hüffner, Nadja Betzler, Rolf Niedermeier |
Separator-based data reduction for signed graph balancing. |
J. Comb. Optim. |
2010 |
DBLP DOI BibTeX RDF |
|
| 1 | Nadja Betzler, Jiong Guo, Rolf Niedermeier |
Parameterized computational complexity of Dodgson and Young elections. |
Inf. Comput. |
2010 |
DBLP DOI BibTeX RDF |
|
| 1 | Nadja Betzler, Britta Dorn |
Towards a dichotomy for the Possible Winner problem in elections based on scoring rules. |
J. Comput. Syst. Sci. |
2010 |
DBLP DOI BibTeX RDF |
|
| 1 | Nadja Betzler |
On Problem Kernels for Possible Winner Determination under the k-Approval Protocol. |
MFCS |
2010 |
DBLP DOI BibTeX RDF |
|
| 1 | Nadja Betzler, Jiong Guo, Christian Komusiewicz, Rolf Niedermeier |
Average Parameterization and Partial Kernelization for Computing Medians. |
LATIN |
2010 |
DBLP DOI BibTeX RDF |
|
| 1 | Nadja Betzler, Robert Bredereck, Rolf Niedermeier |
Partial Kernelization for Rank Aggregation: Theory and Experiments. |
IPEC |
2010 |
DBLP DOI BibTeX RDF |
|
| 1 | Yoram Bachrach, Nadja Betzler, Piotr Faliszewski |
Probabilistic Possible Winner Determination. |
AAAI |
2010 |
DBLP BibTeX RDF |
|
| 1 | Nadja Betzler, Johannes Uhlmann |
Parameterized complexity of candidate control in elections and related digraph problems. |
Theor. Comput. Sci. |
2009 |
DBLP DOI BibTeX RDF |
|
| 1 | Nadja Betzler, Michael R. Fellows, Jiong Guo, Rolf Niedermeier, Frances A. Rosamond |
Fixed-parameter algorithms for Kemeny rankings. |
Theor. Comput. Sci. |
2009 |
DBLP DOI BibTeX RDF |
|
| 1 | Nadja Betzler, Britta Dorn |
Towards a Dichotomy of Finding Possible Winners in Elections Based on Scoring Rules |
CoRR |
2009 |
DBLP BibTeX RDF |
|
| 1 | Nadja Betzler, Susanne Hemmann, Rolf Niedermeier |
A Multivariate Complexity Analysis of Determining Possible Winners Given Incomplete Votes. |
IJCAI |
2009 |
DBLP BibTeX RDF |
|
| 1 | Nadja Betzler, Britta Dorn |
Towards a Dichotomy of Finding Possible Winners in Elections Based on Scoring Rules. |
MFCS |
2009 |
DBLP DOI BibTeX RDF |
|
| 1 | Nadja Betzler, Michael R. Fellows, Jiong Guo, Rolf Niedermeier, Frances A. Rosamond |
How similarity helps to efficiently compute Kemeny rankings. |
AAMAS |
2009 |
DBLP DOI BibTeX RDF |
structural parameterization, exact algorithm, NP-hard problem, fixed-parameter tractability, rank aggregation |
| 1 | Nadja Betzler, Michael R. Fellows, Jiong Guo, Rolf Niedermeier, Frances A. Rosamond |
Fixed-Parameter Algorithms for Kemeny Scores. |
AAIM |
2008 |
DBLP DOI BibTeX RDF |
|
| 1 | Nadja Betzler, Jiong Guo, Rolf Niedermeier |
Parameterized Computational Complexity of Dodgson and Young Elections. |
SWAT |
2008 |
DBLP DOI BibTeX RDF |
|
| 1 | Nadja Betzler, Michael R. Fellows, Christian Komusiewicz, Rolf Niedermeier |
Parameterized Algorithms and Hardness Results for Some Graph Motif Problems. |
CPM |
2008 |
DBLP DOI BibTeX RDF |
|
| 1 | Nadja Betzler, Johannes Uhlmann |
Parameterized Complexity of Candidate Control in Elections and Related Digraph Problems. |
COCOA |
2008 |
DBLP DOI BibTeX RDF |
|
| 1 | Falk Hüffner, Nadja Betzler, Rolf Niedermeier |
Optimal Edge Deletions for Signed Graph Balancing. |
WEA |
2007 |
DBLP DOI BibTeX RDF |
|
| 1 | Nadja Betzler, Rolf Niedermeier, Johannes Uhlmann |
Tree decompositions of graphs: Saving memory in dynamic programming. |
Discrete Optimization |
2006 |
DBLP DOI BibTeX RDF |
|
| 1 | Jochen Alber, Nadja Betzler, Rolf Niedermeier |
Experiments on data reduction for optimal domination in networks. |
Annals OR |
2006 |
DBLP DOI BibTeX RDF |
Preprocessing by data reduction rules, NP-complete problem, Domination, Experimental study, Network optimization, Optimal solutions |
| 1 | Nadja Betzler, Rolf Niedermeier, Johannes Uhlmann |
Tree Decompositions of Graphs: Saving Memory in Dynamic Programming. |
Electronic Notes in Discrete Mathematics |
2004 |
DBLP DOI BibTeX RDF |
|
| 1 | Nadja Betzler, Rolf Niedermeier, Johannes Uhlmann |
Tree Decompositions of Graphs: Saving Memory in Dynamic Programming. |
CTW |
2004 |
DBLP BibTeX RDF |
|
Displaying result #1 - #28 of 28 (100 per page; Change: )
|
|
![[Valid RSS]](Pics/valid-rss.png "Validate my RSS feed")