We show efficient algorithms for edge-coloring planar graphs. Our main result is a linear-time algorithm for coloring planar graphs with maximum degree with max{, 9} colors. Thus...
We investigate the computational complexity of a combinatorial problem that arises in DNA sequencing by hybridization: The input consists of an integer together with a set S of wo...
Jacek Blazewicz, Piotr Formanowicz, Marta Kasprzak...
We study the slow singular limit for planar anharmonic oscillatory motion of a charged particle under the influence of a perpendicular magnetic field when the mass of the particl...
In many practical applications of wireless sensor networks, it is crucial to accomplish the localization of sensors within a given time bound. We find that the traditional defin...
Wei Cheng, Nan Zhang 0004, Min Song, Dechang Chen,...
We present a demonstration of a newly developed text stream event detection method on over a million articles from the New York Times corpus. The event detection is designed to ope...
Tristan Snowsill, Ilias N. Flaounas, Tijl De Bie, ...