@techreport{oai:ipsj.ixsq.nii.ac.jp:00091767,
 author = {Yasuaki, Kobayashi and Hirokazu, Maruta and Yusuke, Nakae and Hisao, Tamaki and Yasuaki, Kobayashi and Hirokazu, Maruta and Yusuke, Nakae and Hisao, Tamaki},
 issue = {4},
 month = {May},
 note = {We consider a simple generalization of two-layer crossing minimization problem (TLCM) called leaf-edge-weighted TLCM (LEW-TLCM), where we allow positive weights on edges incident to leaves, and show that this problem admits a kernel with O(k) edges provided that the given graph is connected. As a straightforward consequence, LEW-TLCM (and hence TLCM) has a fixed parameter algorithm that runs in 2O(k log k) + nO(1) time which improves on the previously best known algorithm with running time 2O(k3)n., We consider a simple generalization of two-layer crossing minimization problem (TLCM) called leaf-edge-weighted TLCM (LEW-TLCM), where we allow positive weights on edges incident to leaves, and show that this problem admits a kernel with O(k) edges provided that the given graph is connected. As a straightforward consequence, LEW-TLCM (and hence TLCM) has a fixed parameter algorithm that runs in 2O(k log k) + nO(1) time which improves on the previously best known algorithm with running time 2O(k3)n.},
 title = {A Linear Edge Kernel for Two-Layer Crossing Minimization},
 year = {2013}
}