| IEICE Technical Committee Submission System Conference Schedule |
Online Proceedings [Sign in] Tech. Rep. Archives |
All Technical Committee Conferences (Searched in: All Years)
| Committee | Date Time | Place | Paper Title / Authors | Abstract | Paper # | |
| VLD, DC, RECONF, ICD, IPSJ-SLDM [detail] | 2023-11-17 14:50 |
Kumamoto | Civic Auditorium Sears Home Yume Hall (Primary: On-site, Secondary: Online) |
An Improved Routing Method by SAT for Set-Pair Routing Problem Koki Nagakura, Kunihiro Fujiyoshi (TUAT)  VLD2023-77 ICD2023-85 DC2023-84 RECONF2023-80 |
A set-pair routing problem is a single-layer routing problem in which combinations of these pins to be connected by rout... [more] | VLD2023-77 ICD2023-85 DC2023-84 RECONF2023-80 pp.243-248 |
| MSS, CAS, SIP, VLD | 2023-07-06 11:20 |
Hokkaido | (Primary: On-site, Secondary: Online) |
Fast Method of Integer Linear Programming for Set-Pair Routing Problem Yasuhiro Takashima (Univ. of Kitakyushu) CAS2023-6 VLD2023-6 SIP2023-22 MSS2023-6 |
This paper proposes a fast method of integer linear programming for Set-pair routing problem. The previous works are fas... [more] | CAS2023-6 VLD2023-6 SIP2023-22 MSS2023-6 pp.28-33 |
| VLD, DC, RECONF, ICD, IPSJ-SLDM [detail] | 2022-11-28 13:55 |
Kumamoto | (Primary: On-site, Secondary: Online) |
A Routing Method by SAT for Set-Pair Routing Problem Koki Nagakura, Rintaro Yokoya, Kunihiro Fujiyoshi (Tokyo Univ of A and T) VLD2022-21 ICD2022-38 DC2022-37 RECONF2022-44 |
Set-pair routing problem is a single-layer routing problem in which a one-to-one connection is made between equal number... [more] | VLD2022-21 ICD2022-38 DC2022-37 RECONF2022-44 pp.13-18 |
| HWS, VLD [detail] | 2020-03-04 09:55 |
Okinawa | Okinawa Ken Seinen Kaikan (Cancelled but technical report was issued) |
A Pin-Pair Routing Method for Length Difference Reduction in Set-Pair Routing Kunihiko Wada, Shimpei Sato, Atsushi Takahashi (TokyoTech) VLD2019-95 HWS2019-68 |
In this paper, we propose a Routing method that aims to reduce total wire length and wire length difference for Set-Pair... [more] | VLD2019-95 HWS2019-68 pp.7-12 |
| VLD, DC, CPSY, RECONF, CPM, ICD, IE, IPSJ-SLDM, IPSJ-EMB, IPSJ-ARC (Joint) [detail] |
2017-11-08 15:55 |
Kumamoto | Kumamoto-Kenminkouryukan Parea | Max Length and Length Difference Minimization for Set Pair Routing Problem with ILP Shutaro Hara, Kunihiro Fujiyoshi (TUAT) VLD2017-60 DC2017-66 |
Set pair routing is the problem to minimize the maximum difference of paths (length difference) that one to one connecte... [more] | VLD2017-60 DC2017-66 pp.241-246 |
| VLD, DC, CPSY, RECONF, CPM, ICD, IE (Joint) [detail] |
2016-11-29 10:55 |
Osaka | Ritsumeikan University, Osaka Ibaraki Campus | Length Difference Minimization with Exchanging Pin Pair for Set Pair Routing Problem Shutaro Hara, Kunihiro Fujiyoshi (TUAT) VLD2016-57 DC2016-51 |
Set pair routing is the problem to minimize the maximum difference of paths(length difference) that one to one connected... [more] | VLD2016-57 DC2016-51 pp.79-84 |
| VLD | 2015-03-02 14:15 |
Okinawa | Okinawa Seinen Kaikan | Zero-weighted Cycle Finding Method for Exchanging Pin Pair on Set-Pair Rouitng Yuta Nakatani, Atsushi Takahashi (Tokyo Tech) VLD2014-156 |
Set pair routing problem has connection requirements which are given between a pair of terminals. In set pair routing pr... [more] | VLD2014-156 pp.19-24 |
| VLD | 2015-03-02 14:55 |
Okinawa | Okinawa Seinen Kaikan | Symmetrical Routing based on Set-pair Routing and Mixed Integer Programming Masato Ito, Qing Dong, Shigetoshi Nakatake (Univ. of Kitakyushu) VLD2014-157 |
This paper proposes a routing algorithm of high routability focusing on symmetrical routing used in analog layout. In a ... [more] | VLD2014-157 pp.25-30 |
| VLD, DC, IPSJ-SLDM, CPSY, RECONF, ICD, CPM (Joint) [detail] |
2014-11-26 15:35 |
Oita | B-ConPlaza | A Method for Total Length and Length Difference Reduction for Set-Pair Routing Yuta Nakatani, Atsushi Takahashi (Titech) VLD2014-87 DC2014-41 |
Set pair routing problem in which connection requirements are given between a pair of terminals is a routing problem on... [more] |
VLD2014-87 DC2014-41 pp.111-116 |
| VLD | 2014-03-04 09:15 |
Okinawa | Okinawa Seinen Kaikan | An Enhancement of Length Difference Reduction Algorithm for Set Pair Routing Yusaku Yamamoto, Atsushi Takahashi (Tokyo Inst. of Tech.) VLD2013-142 |
Recent advances in circuit speed force to realize signal propagation delay accurately. In PCB routing design, desired... [more] |
VLD2013-142 pp.49-54 |
| VLD, DC, IPSJ-SLDM, CPSY, RECONF, ICD, CPM (Joint) [detail] |
2011-11-30 10:05 |
Miyazaki | NewWelCity Miyazaki | A length difference reduction algorithm by using flow in set pair routing problem for single layer PCB routing Yusaku Yamamoto, Atsushi Takahashi (Osaka Univ.) VLD2011-87 DC2011-63 |
Recent advances in circuit speed forces to realize signal propagation delay accurately. In PCB routing design, desire... [more] |
VLD2011-87 DC2011-63 pp.203-208 |
| VLD | 2011-09-26 15:55 |
Fukushima | University of Aizu | On set pair routing problem Atsushi Takahashi (Osaka Univ.) VLD2011-44 |
In this manuscript, set pair routing problem in which connection requirements are given between a pair of terminal sets ... [more] | VLD2011-44 pp.23-28 |
[Return to Top Page]