|
|
All Technical Committee Conferences (Searched in: All Years)
|
|
Search Results: Conference Papers |
Conference Papers (Available on Advance Programs) (Sort by: Date Descending) |
|
Committee |
Date Time |
Place |
Paper Title / Authors |
Abstract |
Paper # |
COMP |
2020-12-04 15:20 |
Online |
Online |
Fixed Parameter Algorithms for L(p,1)-labeling Kazuma Kawai (Nagoya Univ), Tesshu Hanaka (Chuo Univ), Hirotaka Ono (Nagoya Univ) COMP2020-24 |
Given a graph, an $L(p,1)$-labeling of the graph is an assignment $f$ from the vertex set to the set of nonnegative inte... [more] |
COMP2020-24 pp.30-32 |
COMP, IPSJ-AL |
2019-05-11 15:50 |
Kumamoto |
Kumamoto University |
COMP2019-8 |
The {em dimension} of a partially ordered set (poset) is known to be one of the fundamental complexity measures of poset... [more] |
COMP2019-8 pp.91-95 |
COMP |
2018-09-18 14:55 |
Fukuoka |
Kyusyu Institute of Technology |
COMP2018-16 |
Node Kayles is a well-known two-player impartial game on graphs. Given a graph, each player alternately chooses a vertex... [more] |
COMP2018-16 pp.49-53 |
COMP |
2010-01-25 10:05 |
Fukuoka |
Nishijin Plaza, Kyushu University |
Complexity results for the spanning tree congestion problem Yota Otachi (Gunma Univ.), Hans L. Bodlaender (Utrecht Univ.) COMP2009-40 |
We study the computational complexity of determining the \emph{spanning tree congestion} of a graph. First, we show that... [more] |
COMP2009-40 pp.9-16 |
|
|
|
Copyright and reproduction :
All rights are reserved and no part of this publication may be reproduced or transmitted in any form or by any means, electronic or mechanical, including photocopy, recording, or any information storage and retrieval system, without permission in writing from the publisher. Notwithstanding, instructors are permitted to photocopy isolated articles for noncommercial classroom use without fee. (License No.: 10GA0019/12GB0052/13GB0056/17GB0034/18GB0034)
|
[Return to Top Page]
[Return to IEICE Web Page]
|