设为首页
收藏本站
网站地图
|
English
|
公务邮箱
About the library
Background
History
Leadership
Organization
Readers' Guide
Opening Hours
Collections
Help Via Email
Publications
Electronic Information Resources
常用资源
电子图书
期刊论文
学位会议
外文资源
特色专题
内部出版物
SpringerLink电子期刊(22)
Elsevier电子期刊(8)
在“
Elsevier电子期刊
”中,
命中:
8
条,耗时:小于0.01 秒
在所有数据库中总计命中:
30
条
1.
Graph isomorphism for graph classes characterized by two forbidden induced subgraphs
作者:
Stefan
Kratsch
a
;
stefan
.
kratsch
@tu-berlin.de
;
Pascal Schweitzer
b
;
schweitzer@informatik.rwth-aachen.de
关键词:
Graph isomorphism
;
Graph classes
;
Forbidden induced subgraphs
刊名:Discrete Applied Mathematics
出版年:2017
2.
Polynomial kernels for weighted problems
作者:
Michael Etscheid
;
etscheid@cs.uni-bonn.de" class="auth_mail" title="E-mail the corresponding author
;
Stefan
Kratsch
kratsch
@cs.uni-bonn.de" class="auth_mail" title="E-mail the corresponding author
;
Matthias Mnich
mmnich@uni-bonn.de" class="auth_mail" title="E-mail the corresponding author
;
Heiko Rö
;
glin
roeglin@cs.uni-bonn.de" class="auth_mail" title="E-mail the corresponding author
关键词:
Kernelization for weighted parameterized problems
;
FPT
;
Knapsack
;
Subset Sum
;
Integer Linear Programming with bounded variables
刊名:Journal of Computer and System Sciences
出版年:2017
3.
On polynomial kernels for sparse integer linear programs
作者:
Stefan
Kratsch
1
;
kratsch
@cs.uni-bonn.de" class="auth_mail" title="E-mail the corresponding author
关键词:
Parameterized complexity
;
Kernelization
;
Integer linear programs
刊名:Journal of Computer and System Sciences
出版年:2016
4.
Tight bounds for parameterized complexity of Cluster Editing with a small number of clusters
作者:
Fedor V. Fomin
a
;
fomin@ii.uib.no" class="auth_mail
;
Stefan
Kratsch
b
;
stefan
.
kratsch
@tu-berlin.de" class="auth_mail
;
Marcin Pilipczuk
c
;
malcin@mimuw.edu.pl" class="auth_mail
;
Micha艂 Pilipczuk
a
;
michal.pilipczuk@ii.uib.no" class="auth_mail
;
Yngve Villanger
a
;
yngve.villanger@ii.uib.no" class="auth_mail
关键词:
Cluster editing
;
Correlation clustering
;
Parameterized complexity
;
Subexponential-time algorithms
;
Exponential-time hypothesis
刊名:Journal of Computer and System Sciences
出版年:November 2014
5.
Two edge modification problems without polynomial kernels
作者:
Stefan
Kratsch
;
Magnus Wahlstr?m
关键词:
Parameterized complexity
;
Kernelization
;
Graph modification problems
刊名:Discrete Optimization
出版年:2013
6.
Data reduction for graph coloring problems
作者:
Bart M.P. Jansen
;
Stefan
Kratsch
关键词:
Graph coloring
;
Polynomial kernels
;
Structural parameterizations
刊名:Information and Computation
出版年:October, 2013
7.
Kernel bounds for path and cycle problems
作者:
Hans L. Bodlaender
;
Bart M.P. Jansen
;
Stefan
Kratsch
关键词:
Parameterized complexity
;
Kernelization
;
Upper and lower bounds
;
Graphs
;
Path and cycle problems
刊名:Theoretical Computer Science
出版年:4 November, 2013
8.
Parameterized complexity of vertex deletion into perfect graph classes
作者:
Pinar Heggernes
;
Pim van 鈥檛 Hof
;
Bart M.P. Jansen
;
Stefan
Kratsch
;
Yngve Villanger
关键词:
Parameterized complexity
;
Perfect graphs
;
Vertex deletion problems
;
Kernelization
刊名:Theoretical Computer Science
出版年:4 November, 2013
1
按检索点细分(8)
作者(8)
按出版年细分(8)
2027年及以后(4)
2017年(2)
2016年(1)
2013年(1)
NGLC 2004-2010.National Geological Library of China All Rights Reserved.
Add:29 Xueyuan Rd,Haidian District,Beijing,PRC. Mail Add: 8324 mailbox 100083
For exchange or info please contact us via
email
.