设为首页
收藏本站
网站地图
|
English
|
公务邮箱
About the library
Background
History
Leadership
Organization
Readers' Guide
Opening Hours
Collections
Help Via Email
Publications
Electronic Information Resources
常用资源
电子图书
期刊论文
学位会议
外文资源
特色专题
内部出版物
Springer电子图书(59)
SpringerLink电子期刊(131)
Elsevier电子期刊(54)
在“
Elsevier电子期刊
”中,
命中:
54
条,耗时:0.112941 秒
在所有数据库中总计命中:
244
条
1.
Effect of Nd:YAG laser beam welding on weld morphology and mechanical properties of Ti-6Al-4
V
butt joints and T-joints
作者:
Nikolai Kashae
v
;
nikolai.kashae
v
@hzg.de" class="auth_mail" title="E-mail the corresponding author
;
V
olker Ventzke
;
V
adim Fomiche
v
;
Fedor
Fomin
;
Stefan Riekehr
关键词:
Laser beam welding
;
Ti&ndash
;
6Al&ndash
;
4
V
;
T-joint
;
Microstructure
;
Tensile test
;
Pull-out test
刊名:Optics and Lasers in Engineering
出版年:2016
2.
The Firefighter problem on graph classes
作者:
Fedor
V
.
Fomin
a
;
fedor
.
fomin
@ii.uib.no" class="auth_mail" title="E-mail the corresponding author
;
Pinar Heggernes
a
;
pinar.heggernes@ii.uib.no" class="auth_mail" title="E-mail the corresponding author
;
Erik Jan
v
an Leeuwen
b
;
erikjan@mpi-inf.mpg.de" class="auth_mail" title="E-mail the corresponding author
关键词:
Firefighter problem
;
Algorithms
;
Inter
v
al graphs
;
Permutation graphs
;
Split graphs
;
PkPk-free graphs
刊名:Theoretical Computer Science
出版年:2016
3.
Parameterized complexity of the anchored k-core problem for directed graphs
作者:
Rajesh Chitnis
a
;
rajesh.chitnis@weizmann.ac.il" class="auth_mail" title="E-mail the corresponding author
;
Fedor
V
.
Fomin
b
;
c
;
fedor
.
fomin
@ii.uib.no" class="auth_mail" title="E-mail the corresponding author
;
Petr A. Golo
v
ach
b
;
c
;
petr.golo
v
ach@ii.uib.no" class="auth_mail" title="E-mail the corresponding author
关键词:
Parameterized complexity
;
Directed graphs
;
Anchored k-core
刊名:Information and Computation
出版年:2016
4.
How to hunt an in
v
isible rabbit on a graph
作者:
Tatjana
V
. Abramo
v
skaya
a
;
tanya.abramo
v
skaya@gmail.com" class="auth_mail" title="E-mail the corresponding author
;
Fedor
V
.
Fomin
b
;
c
;
fedor
.
fomin
@uib.no" class="auth_mail" title="E-mail the corresponding author
;
Petr A. Golo
v
ach
b
;
c
;
petr.golo
v
ach@uib.no" class="auth_mail" title="E-mail the corresponding author
;
Michał Pilipczuk
d
;
michal.pilipczuk@mimuw.edu.pl" class="auth_mail" title="E-mail the corresponding author
刊名:European Journal of Combinatorics
出版年:2016
5.
Forewords: Special issue on Theory and Applications of Graph Searching Problems
作者:
Fedor
V
.
Fomin
(Guest Editor)
刊名:Theoretical Computer Science
出版年:2016
6.
Parameterized complexity of firefighting
作者:
Cristina Bazgan
a
;
b
;
bazgan@lamsade.dauphine.fr" class="auth_mail
;
Morgan Chopin
a
;
chopin@lamsade.dauphine.fr" class="auth_mail
;
Marek Cygan
c
;
cygan@mimuw.edu.pl" class="auth_mail
;
Michael R. Fellows
d
;
michael.fellows@cdu.edu.au" class="auth_mail
;
Fedor
V
.
Fomin
e
;
fedor
.
fomin
@ii.uib.no" class="auth_mail
;
Erik Jan
v
an Leeuwen
e
;
erikjan@mpi-inf.mpg.de" class="auth_mail
关键词:
Firefighter problem
;
Fixed parameter tractability
;
Kernelization
刊名:Journal of Computer and System Sciences
出版年:No
v
ember 2014
7.
Preprocessing subgraph and minor problems: When does a small
v
ertex co
v
er help?
作者:
Fedor
V
.
Fomin
;
Bart M.P. Jansen
;
Micha艂 Pilipczuk
关键词:
Kernelization complexity
;
Parameterization by
v
ertex co
v
er
刊名:Journal of Computer and System Sciences
出版年:March, 2014
8.
Parameterized complexity of connected e
v
en/odd subgraph problems
作者:
Fedor
V
.
Fomin
;
Petr A. Golo
v
ach
关键词:
Parameterized complexity
;
Euler graph
;
E
v
en graph
;
Odd graph
;
Treewidth
刊名:Journal of Computer and System Sciences
出版年:2014
9.
Searching for better fill-in
作者:
Fedor
V
.
Fomin
;
fomin
@ii.uib.no" class="auth_mail
;
Yng
v
e Villanger
yng
v
e
v
@ii.uib.no" class="auth_mail
关键词:
Local search
;
Minimum fill-in
;
Parameterized complexity
;
Triangulation
;
Chordal graph
刊名:Journal of Computer and System Sciences
出版年:No
v
ember 2014
10.
Beyond bidimensionality: Parameterized subexponential algorithms on directed graphs
作者:
Frederic Dorn
;
Fedor
V
.
Fomin
;
Daniel Lokshtano
v
;
V
enkatesh Raman
;
Saket Saurabh
关键词:
Parameterized algorithms
;
Subexponential running time
;
Directed graph
;
Graph algorithms
刊名:Information and Computation
出版年:December, 2013
1
2
3
4
5
6
按检索点细分(54)
作者(53)
按出版年细分(54)
2027年及以后(4)
2016年(5)
2014年(1)
2013年(1)
2012年(2)
2011年(9)
2010年(5)
2009年(4)
2008年(3)
2007年(1)
2006年(2)
2005年(4)
2004年(5)
2003年(3)
2002年(3)
2001年(1)
2000年及以前(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
.